<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="https://join.if.uinsgd.ac.id/lib/pkp/xml/oai2.xsl" ?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/
		http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
	<responseDate>2026-04-04T16:46:40Z</responseDate>
	<request from="2020-11-14" metadataPrefix="oai_dc" verb="ListRecords">https://join.if.uinsgd.ac.id/index.php/join/oai</request>
	<ListRecords>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/3</identifier>
				<datestamp>2024-05-27T09:12:28Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Analisis Kinerja Kompresi Citra Digital dengan Komparasi DWT, DCT dan Hybrid (DWT-DCT)</dc:title>
	<dc:creator>Faza, Aditya Mahmud</dc:creator>
	<dc:creator>Slamet, Cepy</dc:creator>
	<dc:creator>Nursantika, Dian</dc:creator>
	<dc:subject xml:lang="id-ID">DCT</dc:subject>
	<dc:subject xml:lang="id-ID">DWT</dc:subject>
	<dc:subject xml:lang="id-ID">hybrid</dc:subject>
	<dc:subject xml:lang="id-ID">peak signal to ratio</dc:subject>
	<dc:subject xml:lang="id-ID">mean square error</dc:subject>
	<dc:description xml:lang="id-ID">Penelitian ini merupakan penelitian tentang penerapan transformasi diskrit kosinus (DCT), transformasi wavelet diskrit (DWT), dan hybrid sebagai penggabungan dari kedua transformasi sebelumnya dalam proses kompresi data citra digital. Proses kompresi dilakukan untuk menekan konsumsi sumber daya memory, mempercepat proses transmisi citra digital. Proses kompresi yang dilakukan dapat menghasilkan nilai mean square, peak signal to noise ratio dan waktu yang dibutuhkan untuk proses kompresi dari masing-masing transformasi. Nilai tersebut sebagai parameter untuk tahap komparasi kompresi sehingga pengguna dapat menentukan kinerja kompresi dari setiap transformasi dan dapat menentukan jenis transformasi yang paling baik digunakan untuk proses citra digital.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2016-06-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v1i12</dc:identifier>
	<dc:identifier>10.15575/join.v1i1.3</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 1 No. 1 (2016); 1-5</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 1 No 1 (2016); 1-5</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v1i1</dc:source>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v1i12/13</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2016 Jurnal Online Informatika</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/4</identifier>
				<datestamp>2024-05-27T14:39:42Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Implementasi Algoritma Ant Colony Optimization pada Aplikasi Pencarian Lokasi Tempat Ibadah Terdekat di Kota Bandung</dc:title>
	<dc:creator>Zarman, Andri</dc:creator>
	<dc:creator>Irfan, Mohamad</dc:creator>
	<dc:creator>Uriawan, Wisnu</dc:creator>
	<dc:subject xml:lang="id-ID">Algoritma Ant Colony Optimization</dc:subject>
	<dc:subject xml:lang="id-ID">Tempat Ibadah</dc:subject>
	<dc:subject xml:lang="id-ID">Rute Terdekat.</dc:subject>
	<dc:description xml:lang="id-ID">Indonesia merupakan negara yang penduduknya memeluk berbagai agama, yaitu di antaranya agama: Islam, Kriten, Budha, Hindu. Bandung merupakan kota yang banyak wisatawannya, baik wisatawan lokal maupun mancanegara, fasilitas umum yang ada di Kota Bandung dibutuhkan, salah satunya tempat ibadah. Informasi tentang tempat ibadah cukup diperlukan oleh para wisatawan, karena cukup sulit mendapatkan informasi tempat ibadah di Kota Bandung, khususnya sulit dalam mendapatkan rute terdekat (shourtest paht) menuju tempat ibadah tersebut. Penelitian ini dibuat untuk merancang sebuah aplikasi yang memberikan informasi serta petunjuk arah tempat ibadah di Kota Bandung, dengan menerapkan Algoritma Ant Colony Optimization. Aplikasi ini digunakan pada perangkat Smatrphone/Android, oleh karena itu, aplikasi ini cukup flexibel untuk digunakan. Aplikasi ini menggunakan dukungan web service, sehingga data mudah di inputkan oleh admin.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2016-06-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v1i13</dc:identifier>
	<dc:identifier>10.15575/join.v1i1.4</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 1 No. 1 (2016); 6-12</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 1 No 1 (2016); 6-12</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v1i1</dc:source>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v1i13/14</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2016 Jurnal Online Informatika</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/5</identifier>
				<datestamp>2023-07-24T09:24:25Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Implementasi Algoritma Divide And Conquer Pada Aplikasi Belajar Ilmu Tajwid</dc:title>
	<dc:creator>Suryani, Dais</dc:creator>
	<dc:creator>Irfan, Mohamad</dc:creator>
	<dc:creator>Uriawan, Wisnu</dc:creator>
	<dc:creator>Zulfikar, Wildan Budiawan</dc:creator>
	<dc:subject xml:lang="id-ID">Al-Quran</dc:subject>
	<dc:subject xml:lang="id-ID">tajwid</dc:subject>
	<dc:subject xml:lang="id-ID">mobile</dc:subject>
	<dc:subject xml:lang="id-ID">divide and conquer</dc:subject>
	<dc:subject xml:lang="id-ID">Brute Force</dc:subject>
	<dc:subject xml:lang="id-ID">kompleksitas</dc:subject>
	<dc:description xml:lang="id-ID">Seorang muslim harus bisa membaca ayat-ayat Al-Quran dengan baik sesuai yang diajarkan oleh Rasulullah saw. Membaca Al-Quran sesuai ilmu tajwid hukumnya wajib bagi setiap orang, tidak bisa diwakili oleh orang lain. Aplikasi ilmu tajwid yang dibangun bersifat mobile, sehingga user dapat mempelajari tajwid dimana saja dan kapan saja. Selain menambah wawasan tentang tajwid, user dapat membaca Al-Quran secara fasih sesuai hukum tajwid karena aplikasi yang bersifat mobile ini mendukung pembelajaran menggunakan teks dan suara. Selain itu user dapat juga mengasahÂ  kemampuannya tentang ilmu tajwid melalui soal-soal yang ada dalam aplikasi. Aplikasi Belajar Ilmu Tajwid menerapkan salah satu algoritma yaitu divide and conquer. Algoritma divide and conquer diimplementasikan pada pencarian jawaban pada soal yang ada pada menu latihan. Algoritma divide and conquer mempunyai cara kerja membagi masalah menjadi beberapa sub masalah sehingga dihasilkan solusi akhir dari masalah awal. Algoritma divide and conquer mempunyai kompleksitas yang cukup cepat yaitu 2,86272753, dibandingkan dengan algoritma Brute Force yang memiliki kompleksitas lebih tinggi daripada algoritma divide and conquer yaitu 6.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2016-06-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v1i14</dc:identifier>
	<dc:identifier>10.15575/join.v1i1.5</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 1 No. 1 (2016); 13-19</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 1 No 1 (2016); 13-19</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v1i1</dc:source>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v1i14/22</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2016 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/6</identifier>
				<datestamp>2024-05-27T14:33:41Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Sistem Klasifikasi Jenis Tanaman Hias Daun Philodendron Menggunakan Metode K-Nearest Neighboor (KNN) Berdasarkan Nilai Hue, Saturation, Value (HSV)</dc:title>
	<dc:creator>Syahid, Dani</dc:creator>
	<dc:creator>Jumadi, Jumadi</dc:creator>
	<dc:creator>Nursantika, Dian</dc:creator>
	<dc:subject xml:lang="id-ID">Hue</dc:subject>
	<dc:subject xml:lang="id-ID">Saturation</dc:subject>
	<dc:subject xml:lang="id-ID">Value (HSV)</dc:subject>
	<dc:subject xml:lang="id-ID">K-Nearest Neighboor (KNN)</dc:subject>
	<dc:subject xml:lang="id-ID">Tanaman hias daun Philodendron</dc:subject>
	<dc:description xml:lang="id-ID">Tanaman hias daun biasa digunakan untuk mempercantik halaman pekarangan rumah dengan aneka warna yang indah pada tanaman hias daun ini menjadi bahan perhatian khususnya bagi pecinta tanaman. Namun dengan banyaknya jenis tanaman hias membuat kita sulit untuk mengetahui nama tumbuhan yang kita minati.Sistem pendeteksi citra tanaman hias daun bekerja dengan cara membandingkan data citra latih yang telah tersimpan pada database terhadap data citra yang akan diuji. Data citra uji akan diklasifikasikan dengan menggunakan penerapan metode K-Nearest Neighboor yaitu berfungsi untuk menghitung jarak terdekat antara data citra latih dan data citra uji pada setiap pikselnya. Setiap piksel pada citra akan dilakukan proses konversi red, Green, Blue (RGB) ke dalam ekstraksi fitur warna hue, saturation, value (HSV) terlebih dahulu. Setelah didapat nilai HSV, maka dilakukan proses klasifikasi menggunakan metode KNN. Data sampel pada penelitian ini menggunakan 5 klasifikasi citra data latih dengan 10 data citraÂ  uji pada setiap data citra latih. Pada penelitian ini, diperoleh hasil dari akurasi sistem pendeteksi citra tanaman dengan hasil mencapai 92%.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2016-06-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v1i15</dc:identifier>
	<dc:identifier>10.15575/join.v1i1.6</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 1 No. 1 (2016); 20-23</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 1 No 1 (2016); 20-23</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v1i1</dc:source>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v1i15/15</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2016 Jurnal Online Informatika</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/7</identifier>
				<datestamp>2023-07-24T09:24:25Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Klasifikasi Terjemahan Ayat Al-Quran Tentang Ilmu Sains Menggunakan Algoritma Decision Tree Berbasis Mobile</dc:title>
	<dc:creator>Setiawati, Devi</dc:creator>
	<dc:creator>Taufik, Ichsan</dc:creator>
	<dc:creator>Jumadi, Jumadi</dc:creator>
	<dc:creator>Zulfikar, Wildan Budiawan</dc:creator>
	<dc:subject xml:lang="id-ID">Algorithm C4.5</dc:subject>
	<dc:subject xml:lang="id-ID">Al-Quran</dc:subject>
	<dc:subject xml:lang="id-ID">Decision tree</dc:subject>
	<dc:description xml:lang="id-ID">The number of verses of the Quran contained in the Qur&#039;an, encouraging people to look for a way to get the exact clause in a short time. The science is an important knowledge, as Muslims we are obliged to study it with the Al-Quran as a guide. So that&#039;s how we get the verse about the science of the Quran with a quick, efficient and practical with a mobile application. Decision tree is a predictive model using a tree or hierarchical structure, this method can support mobile applications to be created. Because based decision very complex and global in the Quran, can be transformed into more simple and specific. C4.5 algorithm is a decision tree induction algorithm and is suitable to perform the classification process. The results of the percentage of successful applications created by using a decision tree that is 75.73%. From these results is known that the algorithm C4.5 and decision tree reasonably is well used in the classification process.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2016-06-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v1i16</dc:identifier>
	<dc:identifier>10.15575/join.v1i1.7</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 1 No. 1 (2016); 24-27</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 1 No 1 (2016); 24-27</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v1i1</dc:source>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v1i16/16</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2016 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/8</identifier>
				<datestamp>2024-05-27T14:28:45Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Implementasi Teknologi Augmented Reality pada Buku Panduan Wudhu Berbasis Mobile Android</dc:title>
	<dc:creator>Setiawan, Erwin</dc:creator>
	<dc:creator>Syaripudin, Undang</dc:creator>
	<dc:creator>Gerhana, Yana Aditia</dc:creator>
	<dc:subject xml:lang="id-ID">Augmented Reality</dc:subject>
	<dc:subject xml:lang="id-ID">buku</dc:subject>
	<dc:subject xml:lang="id-ID">wudhu</dc:subject>
	<dc:subject xml:lang="id-ID">Android</dc:subject>
	<dc:description xml:lang="id-ID">Augmented Reality (AR) adalah teknologi interaktif yang mampu memproyeksikan objek maya ke dalam objek nyata secara real time. Perkembangan teknologi AR dewasa ini telah memberikan banyak kontribusi ke dalam berbagai bidang. Salah satu implementasi AR di bidang edukasi adalah AR Book. Buku merupakan salah satu media pembelajaran yang banyak digunakan. Selain itu, buku juga digunakan sebagai alat berkomunikasi oleh guru maupun orang tua terhadap anak-anak, misalkan seperti jenis buku panduan mengenai tatacara wudhu. Wudhu adalah suatu bentuk peribadatan kepada Allah Ta’ala dengan mencuci anggota tubuh tertentu dengan tata cara yang khusus. Wudhu khususnya diperintahkan sebelum melaksanakan ibadah shalat dan thawaf. Umat muslim harus mengetahui tatacara berwudhu yang benar. Salah satu sistem operasi yang digunakan pada mobile phone atau smartphone yaitu Android. Android adalah sebuah sistem operasi untuk perangkat mobile yang berbasis Linux dan bersifat open source. Dengan memanfaatkan media mobile untuk membangun aplikasi menggunakan teknologi augmented reality sebagai media pembelajaran, aplikasi AR berbasis mobile mempunyai keunggulan karena sifatnya yang mudah berpindah</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2016-06-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v1i17</dc:identifier>
	<dc:identifier>10.15575/join.v1i1.8</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 1 No. 1 (2016); 28-33</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 1 No 1 (2016); 28-33</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v1i1</dc:source>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v1i17/17</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2016 Jurnal Online Informatika</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/9</identifier>
				<datestamp>2023-07-24T09:24:25Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Aplikasi Pembelajaran Bahasa Sunda Dengan Implementasi Algoritma Linear Congruential Generator Dan Fuzzy Berbasis Android</dc:title>
	<dc:creator>Pribadi, Ganteng Eki</dc:creator>
	<dc:creator>Syaripudin, Undang</dc:creator>
	<dc:creator>Uriawan, Wisnu</dc:creator>
	<dc:subject xml:lang="id-ID">Bahasa Sunda</dc:subject>
	<dc:subject xml:lang="id-ID">Linear Congruential Generator</dc:subject>
	<dc:subject xml:lang="id-ID">Fuzzy</dc:subject>
	<dc:subject xml:lang="id-ID">Aplikasi Android</dc:subject>
	<dc:description xml:lang="id-ID">Bahasa merupakan media komunikasi yang penting bagi manusia. Salah satunya bahasa Sunda yang merupakan salah satu bahasa Ibu untuk sebagian orang di Indonesia khususnya daerah Jawa Barat dan Banten. Seiring perkembangan zaman hanya 40% anak di daerah Jawa Barat dan sekitarnya yang mampu dan paham berbahasa Sunda, jika dibiarkan terus terjadi maka Suku Sunda akan kehilangan identitasnya. Seiring dengan perkembangan zaman android merupakan kebutuhan bagi manusia, karena hal tersebut android bisa dijadikan media pembelajaran. Dengan bantuan media android untuk pembelajaran bahasa Sunda diharapkan dapat membantu anak-anak meningkatkan hafalan kosakata bahasa Sunda. Penilaian menjadi tolak ukur keberhasilan pembelajaran, metode Fuzzy dapat membantu penilaian di dalam sistem pembelajaran ini serta algoritma Linear Congruential Generator dapat membantu dalam proses pengacakan soal yang ada pada sistem pembelajaran ini.Kata Kunci: Augmented Reality, buku, wudhu, Android.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2016-06-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v1i18</dc:identifier>
	<dc:identifier>10.15575/join.v1i1.9</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 1 No. 1 (2016); 34-42</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 1 No 1 (2016); 34-42</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v1i1</dc:source>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v1i18/19</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2016 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/10</identifier>
				<datestamp>2024-05-27T12:17:00Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Sistem Pendukung Keputusan Penentu Dosen Penguji Dan Pembimbing Tugas Akhir Menggunakan  Fuzzy Multiple Attribute Decision Making dengan Simple Additive Weighting (Studi Kasus: Jurusan Teknik Informatika UIN SGD Bandung)</dc:title>
	<dc:creator>Septiana, Ian</dc:creator>
	<dc:creator>Irfan, Mohamad</dc:creator>
	<dc:creator>Atmadja, Aldy Rialdy</dc:creator>
	<dc:creator>Subaeki, Beki</dc:creator>
	<dc:subject xml:lang="id-ID">Pembimbing</dc:subject>
	<dc:subject xml:lang="id-ID">Penguji</dc:subject>
	<dc:subject xml:lang="id-ID">Dosen</dc:subject>
	<dc:subject xml:lang="id-ID">Sistem Pendukung Keputusan</dc:subject>
	<dc:subject xml:lang="id-ID">FMADM</dc:subject>
	<dc:subject xml:lang="id-ID">SAW</dc:subject>
	<dc:description xml:lang="id-ID">Penentuan dosen penguji dan pembimbing skripsi adalah hal yang harus dilakukan disetiap universitas untuk membantu mahasiswa dalam menyelesaikan skripsinya. Dalam menentukan hal tersebut kadang terjadi keputusan yang kurang optimal dimana dosen yang ditunjuk kurang sesuai dengan topik skripsi mahasiswa akibatnya dapat mengurangi kualitas karya ilmiah mahasiswa. Untuk memecahkan masalah tersebut maka dibutuhkan sistem pendukung keputusan yang dapat memberikan rekomendasi dosen penguji dan pembimbing. Salah satu metode yang dapat digunakan adalah FMADM (Fuzzy Multiple Attribute Decission Making). Proses penentuan rekomendasi dosen penguji dan pembimbing dilakukan dengan mencari alternatif terbaik berdasarkan kriteria-kriteria yang telah ditentukan melalui metode SAW (Sample Additive Weighting). Adapun metode FMADM dipilih karena mampu menyeleksi alternatif terbaik dari sejumlah alternatif. Dengan mencari nilai bobot untuk setiap atribut, kemudian dilakukan proses perangkingan yang menghasilkan alternatif yang optimal, untuk menentukan dosen penguji dan pembimbing</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2016-06-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v1i19</dc:identifier>
	<dc:identifier>10.15575/join.v1i1.10</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 1 No. 1 (2016); 43-50</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 1 No 1 (2016); 43-50</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v1i1</dc:source>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v1i19/18</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2016 Jurnal Online Informatika</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/11</identifier>
				<datestamp>2024-05-27T11:57:03Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Implementasi Algoritma Fisher-Yates dan Fuzzy Tsukamoto dalam Game Kuis Tebak Nada Sunda Berbasis Android</dc:title>
	<dc:creator>Haditama, Imam</dc:creator>
	<dc:creator>Slamet, Cepy</dc:creator>
	<dc:creator>Fauzy, Deny</dc:creator>
	<dc:subject xml:lang="id-ID">Titi Laras</dc:subject>
	<dc:subject xml:lang="id-ID">Fisher-Yates</dc:subject>
	<dc:subject xml:lang="id-ID">Fuzzy Tsukamoto</dc:subject>
	<dc:subject xml:lang="id-ID">Aplikasi Android</dc:subject>
	<dc:description xml:lang="id-ID">Titi laras merupakan tangga nada yang digunakan pada jenis alat musik karawitan (gamelan) yang merupakan salah satu seni kebudayaan Jawa Barat. Karena kesenian merupakan salah satu unsur budaya yang bersifat universal, maka kesenian tersebut perlu dilestarikan. Fisher-Yatesmerupakanteknik pengacakan pada soal sehingga soal yang keluar akan berbeda dan bisa dihasilkan tanpa pengulangan dan duplikasi. Fuzzy  Tsukamotomerupakan metode yang digunakan dalam pengambilan keputusan untuk  menentukan skor pada akhir kuis. Untuk menentukan berapa nilai tertinggi dalam kuis adalah dengan cara menghitung x = waktu dan x = nilai, proses perhitungan dilakukan dengan cara menghitung variabel-varibel Fuzzy Logicyang telah ditentukan. Dari penelitian ini dapat ditemukan bahwa Fisher-Yatesmampu menentukan solusi pengacakan yang tidak berganda dan pengacakan objek yang variatif. Fuzzy Tsukamoto memiliki akurasi yang  cukup baik antara perhitungan berdasarkan sistem dan perhitungan secara manual, meskipun tidak menunjukan hasil yang 100% sama pada masing-masing perhitungan. Rentan nilai antara perhitungan sistem dengan perhitungan manual mempunyai rentan  yang berbeda pada setiap nilainnya</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2016-06-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v1i110</dc:identifier>
	<dc:identifier>10.15575/join.v1i1.11</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 1 No. 1 (2016); 51-58</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 1 No 1 (2016); 51-58</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v1i1</dc:source>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v1i110/20</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2016 Jurnal Online Informatika</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/12</identifier>
				<datestamp>2024-05-27T09:05:27Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Perbandingan Metode Cosine Similarity Dengan Metode Jaccard Similarity Pada Aplikasi Pencarian Terjemah Al-Qur&#039;an dalam Bahasa Indonesia</dc:title>
	<dc:creator>Nurdiana, Ogie</dc:creator>
	<dc:creator>Jumadi, Jumadi</dc:creator>
	<dc:creator>Nursantika, Dian</dc:creator>
	<dc:subject xml:lang="id-ID">Relevan</dc:subject>
	<dc:subject xml:lang="id-ID">Cosine</dc:subject>
	<dc:subject xml:lang="id-ID">Jaccard</dc:subject>
	<dc:subject xml:lang="id-ID">Nearest Neighbor (K-NN)</dc:subject>
	<dc:subject xml:lang="id-ID">Al-Qur&#039;an</dc:subject>
	<dc:description xml:lang="id-ID">Todays there are more applications supporting Al-Qur&#039;an to facilitate such a study, which could be called digital Al-Qur&#039;an. But when using applications digital Al-Qur&#039;an, which has many applications users experience difficulties when searching for a word that users want.This occurs when users misspell a word you want to search and applications that are not yet able to identify or justify the wrong word. In this thesis made the information retrieval system that is used to find information that is relevant to the needs of its users automatically based on conformity to the query of a collection of information.Algoritma used to determine the similarity (degree of similarity) or relevant similarity algoritma, cosine, Jaccard, and nearest neighbor (k-nn) for comparing algoritma that are more relevant to the translation application alquran. The test result proves that the cosine similarity algoritma has the highest value with the percentage of 41% compared with Jaccard 19% algoritma and nearest neighbor (k-nn) 40% on translation of Al-Qur&#039;an as much 6326 document and 33 query different experiments.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2016-06-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/12</dc:identifier>
	<dc:identifier>10.15575/join.v1i1.12</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 1 No. 1 (2016); 59-63</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 1 No 1 (2016); 59-63</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v1i1</dc:source>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/12/21</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2016 Jurnal Online Informatika</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/32</identifier>
				<datestamp>2024-05-27T09:06:23Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Aplikasi Pembelajaran Menyusun Ayat Sebagai Metode Menghafal Al-Qur&#039;an (Juz 30)</dc:title>
	<dc:creator>Norhan, Linda</dc:creator>
	<dc:creator>Sanjaya, Laras</dc:creator>
	<dc:subject xml:lang="id-ID">aplikasi</dc:subject>
	<dc:subject xml:lang="id-ID">belajar</dc:subject>
	<dc:subject xml:lang="id-ID">Macromedia Flash</dc:subject>
	<dc:subject xml:lang="id-ID">Al-Qur&#039;an</dc:subject>
	<dc:description xml:lang="id-ID">Al-Qur&#039;an adalah wahyu Allah Subhanahu wa ta&#039;ala yang diturunkan kepada nabi Muhammad Shallallahu ‘alaihi wasallam. Berdasarkan hasil wawancara dengan pihak Rumah Tahfiz Al Qur&#039;an Nurul Hidayah salah satu lembaga pendidikan yang menyediakan fasilitas menghafal Al-Qur&#039;an, saat ini menghafal Al Qur&#039;an memiliki keterbatasan dalam hal tempat berupa lembaga pendidikan yang menyediakan fasilitas untuk menghafal Al Qur&#039;an. Selain itu terbatasnya pengajar dalam menghafal Al Qur&#039;an, penerapan metode menghafal yang cukup sulit untuk diimplementasikan dengan keterbatasan peralatan yang ada, menyebabkan timbulnya permasalahan. Dengan pendekatan teknologi yang ada diharapkan menghafal Al-Qur&#039;an dapat dilakukan semaksimal mungkin. Kondisi ini dapat dipenuhi dengan adanyasebuah solusi yaitu dengan membangun sebuah aplikasi bantu dalam menghafal Al Qur&#039;an, sehingga bisa diakses dimana saja berada. Menyediakan fitur-fitur yang diperlukan sesuai dengan metode yang sudah ada, yaitu bisa membaca dan mendengarkan berulang-ulang(muraja&#039;ah). Untuk membuat sebuah aplikasi ini, digunakan perangkat lunak (software) Macromedia Flash 8 Professional sebagai pemrograman dan pembuatan animasi pada aplikasi pembelajaran ini, sedangkan Adobe Photoshop CS3 sebagai pengeditan gambar serta tulisan-tulisan dalam aplikasi pembelajaran, Total Video Converter melakukan pengubah suara (audio) dalam bentuk format lainnya, Nero WaveEditorsebagai pemotong atau pengeditan suara (audio) yang ingin di ambil dengan format .mp3 maupun .wav. Dengan dibuatnya aplikasi ini diharapkan dapat membantu dan memudahkan dalam menghafal Al Qur&#039;an.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2016-12-31</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v1i25</dc:identifier>
	<dc:identifier>10.15575/join.v1i2.32</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 1 No. 2 (2016); 87-91</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 1 No 2 (2016); 87-91</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v1i2</dc:source>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v1i25/pdf</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2016 Jurnal Online Informatika</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/33</identifier>
				<datestamp>2023-07-24T09:19:59Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">PERBANDINGAN NAIVE BAYES CLASSIFIER DENGAN NEAREST NEIGHBOR UNTUK IDENTIFIKASI PENYAKIT MATA</dc:title>
	<dc:creator>Zulfikar, Wildan Budiawan</dc:creator>
	<dc:creator>Lukman, Nur</dc:creator>
	<dc:subject xml:lang="id-ID">Identifikasi</dc:subject>
	<dc:subject xml:lang="id-ID">Penyakit Mata</dc:subject>
	<dc:subject xml:lang="id-ID">Naive Bayes Classifier</dc:subject>
	<dc:subject xml:lang="id-ID">Nearest Neighbor</dc:subject>
	<dc:description xml:lang="id-ID">Naive Bayes Classifier dan Nearest Neighbor merupakan algoritma klasifikasi. Kedua algoritma tersebut dapat dikombinasikan dan dibandingkan untuk mendapatkan akurasi dan kecepatan dalam proses identifikasi penyakit mata. Sebuah penyakit mata dapat diidentifikasi dari gejala-gejala yang timbul pada pasien. Sebuah penyakit mata memiliki gejala yang beragam, sebuah penyakit mata juga dapat memiliki gejala yang menyerupai gejala penyakit mata yang lain. Untuk menentukan atau mengidentifikasi jenis penyakit mata yang diderita pasien diperlukan klasifikasi gejala penyakit mata.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2016-12-31</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v1i24</dc:identifier>
	<dc:identifier>10.15575/join.v1i2.33</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 1 No. 2 (2016); 82-86</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 1 No 2 (2016); 82-86</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v1i2</dc:source>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v1i24/pdf</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2016 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/36</identifier>
				<datestamp>2023-07-24T09:19:59Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">IMPLEMENTASI SISTEM PAKAR DIAGNOSA KERUSAKAN PADA CANON NP6650XX MENGGUNAKAN METODA DEMPSTER SHAFER</dc:title>
	<dc:creator>Manaf, Khaerul</dc:creator>
	<dc:subject xml:lang="id-ID">Expert System</dc:subject>
	<dc:subject xml:lang="id-ID">Knowledge</dc:subject>
	<dc:subject xml:lang="id-ID">Canon Machinery</dc:subject>
	<dc:subject xml:lang="id-ID">Error</dc:subject>
	<dc:subject xml:lang="id-ID">Dempster Shafer</dc:subject>
	<dc:description xml:lang="id-ID">Sistem pakar adalah sebuah perangkat lunak komputer yang memiliki basis pengetahuan. Dimana pengetahuan diambil dari beberapa orang pakar dengan pengalamannya bekerja selama bertahun-tahun pada sebuah bidang keahlian tertentu. Sistem pakar lebih mudah dikembangkan dan spesifikasinya juga tidak terlalu sulit, sehingga dapat digunakan oleh komputerkomputer yang ada sekarang ini.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2016-12-31</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v1i26</dc:identifier>
	<dc:identifier>10.15575/join.v1i2.36</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 1 No. 2 (2016); 92-97</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 1 No 2 (2016); 92-97</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v1i2</dc:source>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v1i26/pdf</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2016 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/37</identifier>
				<datestamp>2023-07-24T09:19:59Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">PEMODELAN SISTEM INFORMASI KEUANGAN DAERAH PADA DIREKTORAT EVALUASI PENDANAAN DAN INFORMASI KEUANGAN DAERAH</dc:title>
	<dc:creator>Bhakti, Demmy Dharma</dc:creator>
	<dc:subject xml:lang="id-ID">SIKD</dc:subject>
	<dc:subject xml:lang="id-ID">LPKD</dc:subject>
	<dc:subject xml:lang="id-ID">UML</dc:subject>
	<dc:subject xml:lang="id-ID">SoaML.</dc:subject>
	<dc:description xml:lang="id-ID">Abstrak- Tata cara pengiriman data informsi keuangan daerah dari pemerintah daerah ke Direktorat EPIKD masih dirasa belum efektif, penyimpanan elemen data yang disatukan dalam sebuah tabel dan penggunaan berkas csv sebagai media berkas pun menjadi kendala tatkala harus di migrasi ke dalam basis data SIKD dan dibuat LKPD sebagai tujuan akhir dari SIKD. penelitian ini yang memiliki tujuan untuk menganalisis proses bisnis sistem informasi keuangan daerah, menganalisis kebutuhan sistem informasi keuangan daerah di kementerian keuangan, dan untuk merancang sistem informasi keuangan daerah berdasarkan proses bisnis SIKD. Proses analisis dan merancang SIKD pada penelitian ini menggunakan berbagai diagram pemodelan berbasis objek, yaitu UML dan SoaML. SoaML digunakan untuk kebutuhan pemodelan perancangan web service berteknologi SOAP. Â Rational Unified Process (RUP)Â  yang terdiri Inception dan Ellaboration dengan kegiatan business modelling, requirements, dan analysis and design pada setiap tahapan digunakan untuk memodelkan system. Penggunaan web service dengan teknologi SOAP mampu melayani komunikasi data secara netral tidak tergantung kepada platform yang digunakan sehingga semua aplikasi keuangan daerah yang saat ini dipakai di berbagai pemerintah daerah dapat mengirimkan data informasi keuangan daerah dengan berbasiskan teknologi web service.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2016-12-31</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v1i27</dc:identifier>
	<dc:identifier>10.15575/join.v1i2.37</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 1 No. 2 (2016); 98-106</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 1 No 2 (2016); 98-106</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v1i2</dc:source>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v1i27/pdf</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2016 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/40</identifier>
				<datestamp>2023-07-24T09:19:59Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Kalkulator Visual Pada Tulisan Tangan Memanfaatkan Pengenalan Pola Berbasis Aturan Dengan Levenshtein Distance untuk Menghasilkan Informasi Ucapan</dc:title>
	<dc:creator>Ridwan, Taufik</dc:creator>
	<dc:creator>Indra N. S., Muhammad</dc:creator>
	<dc:description xml:lang="id-ID">Ketika diberikan tulisan dalam representasi citra, operasi dasar matematika sebenarnya mudah untuk dilakukan oleh manusia karena manusia telah memiliki pengetahuan untuk dapat melakukannya. Namun tidak begitu halnya dengan komputer. Diperlukan proses untuk menirukan proses pengenalan tulisan tangan yang dilakukan manusia. Praproses, Ekstraksi fitur, serta perhitungan jarak dengan Levenshtein adalah proses-proses yang didahului.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2016-12-31</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v1i28</dc:identifier>
	<dc:identifier>10.15575/join.v1i2.40</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 1 No. 2 (2016); 107-110</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 1 No 2 (2016); 107-110</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v1i2</dc:source>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v1i28/pdf</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2016 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/43</identifier>
				<datestamp>2023-07-24T09:19:59Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">PENGEMBANGAN APLIKASI PENJADWALAN KEGIATAN PELATIHAN TEKNOLOGI INFORMASI DAN KOMUNIKASI DENGAN ALGORITMA GENETIKA (STUDI KASUS: BPRTIK)</dc:title>
	<dc:creator>Puspita, Restie Maya</dc:creator>
	<dc:creator>Arini, Arini</dc:creator>
	<dc:creator>Masrurah, Siti Ummi</dc:creator>
	<dc:subject xml:lang="id-ID">Optimasi Penjadwalan Kegiatan</dc:subject>
	<dc:subject xml:lang="id-ID">Algoritma Genetika</dc:subject>
	<dc:subject xml:lang="id-ID">PHP</dc:subject>
	<dc:description xml:lang="id-ID">Penelitian ini bertujuan untuk mengembangkan aplikasi yang dapat mengoptimalkan penjadwalan kegiatan di Balai Pelatihan Riset Teknologi Informasi dan Komunikasi (BPRTIK), Ciputat, Tangerang Selatan dengan mengimplementasikan Algoritma Genetika (AG). Penulis memahami bahwa proses kegiatan yang diatur secara manual belum dapat dilakukan secara optimal sehingga perlu adanya revisi rancangan kegiatan yang dikelola secara maksimal melalui penggunaan aplikasi optimasi penjadwalan yang terstruktur secara otomatis. Oleh sebab itu, kebutuhan terhadap optimasi penjadwalan menjadi penting dan pembuatan aplikasi pada bidang tersebut harus dibangun secara komperhensif. Algoritma Genetika menawarkan metode komperhensif dalam pengolahan data optimal dengan mengadopsi konsep seleksi alam sebagai tolak ukur dalam pemilihan dan penentuan data yang diperlukan. Di samping itu, untuk mengembangkan dan mengukur AG, penulis juga menerapkan metodologi Rapid Application Development (RAD) yang mencakup fase perencanaan, desain perancangan, dan fase pelaksanaan dalam proses pengembangan sistem aplikasi yang selanjutnya dikembangkan dengan PHP dan MySQL sebagai platform utama dan Adobe Dreamweaver CS6 dan Microsoft Visio 2007 sebagai infrastruktur grafis. Sebagai kesimpulan, penulis menemukan bahwa implementasi Algoritma Genetika pada aplikasi optimasi penjadwalan kegiatan menghasilkan kinerja yang lebih optimal pada proses pemilihan dan pengolahan data pada aplikasi yang telah dikelola sehingga menghasilkan produk penjadwalan yang lebih terstruktur.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2016-12-31</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v1i23</dc:identifier>
	<dc:identifier>10.15575/join.v1i2.43</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 1 No. 2 (2016); 76-81</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 1 No 2 (2016); 76-81</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v1i2</dc:source>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v1i23/pdf</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2016 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/44</identifier>
				<datestamp>2023-07-24T09:19:59Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">APLIKASI MULTIMEDIA TERJEMAHAN SURAH YASIN DALAM BAHASA JAWA MENGGUNAKAN BAHASA PEMROGRAMAN LINGO</dc:title>
	<dc:creator>Ridho, Moh. Ali</dc:creator>
	<dc:creator>Arini, Arini</dc:creator>
	<dc:creator>Katjong, Bakrie La</dc:creator>
	<dc:subject xml:lang="id-ID">Bahasa Jawa</dc:subject>
	<dc:subject xml:lang="id-ID">Multimedia Interaktif</dc:subject>
	<dc:subject xml:lang="id-ID">Source Lingo</dc:subject>
	<dc:subject xml:lang="id-ID">Surah Yasin</dc:subject>
	<dc:description xml:lang="id-ID">Surah Yasin adalah salah satu surah dalam Al-Qurâ€™an yang sudah umum dibaca dihampir di setiap pengajian atau di kegiatan keagamaan Islam lainnya sebagai bacaan utama. Berdasarkan data sensus penduduk tahun 2010 dari Badan Pusat Statistik RI, pemeluk agama Islam di daerah Jawa mencapai 62% dan yang terbanyak diantara daerah-daerah lain di Indonesia. Dari hasil wawancara dengan bapak Dr. Suwendi selaku kepala Seksi Ketenagaan Subdit Pendidikan Diniyah dan Pondok Pesantren Kemeneterian Agama RI menyatakan bahwa penyebaran pendidikan Al-Qurâ€™an kepada masayarakat Islam di daerah Jawa masih sangat minim dan juga belum ada metode pembelajaran pendidikan Islam yang menggunakan bahasa Jawa sebagai bahasa utama dalam metode pengajarannya. Oleh karenanya pembuatan aplikasi terjemahan surah Yasin ke dalam bahasa Jawa diharapkan dapat menarik minat generasi muda untuk kembali membudayakan bahasa Jawa dan memberi pemahaman lebih bagi umat Islam di Jawa dalam memahami surah-surah dalam Al-Qurâ€™an, khususnya surah Yasin. Dalam penelitian ini, menggunakan metode studi pustaka, wawancara dan kuesioner dalam pengumpulan data. Pengembangan sistem mengguanakan metode Multimedia Development Life Cycle dari Luther dimana tahapannya adalah konsep (concept), perancangan (design), pengumpulan bahan (material collecting), pembuatan (assembly), pengujian (testing) dan distribusi (distribution). Dari penelitian ini dihasilkan aplikasi multimedia terjemahan surah Yasin ke dalam bahasa Jawa dan hasil aplikasi disebarkan melalui pihak Kemenag RI serta diunggah di website file sharing. Disarankan untuk penelitian selanjutnya agar ditambahkan database surah-surah lain dalam Al-Qurâ€™an lengkap dengan tafsirnya, penambahan kosakata kamus, perlu adanya rancangan aplikasi berbasis smartphone dan peningkatan algoritma yang digunakan pada fitur kamus. Tools yang digunakan dalam pembuatan aplikasi ini diantaranya software Adobe Director, Adobe Photoshop, Adobe Flash dan Arca Database Browser.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2016-12-31</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v1i22</dc:identifier>
	<dc:identifier>10.15575/join.v1i2.44</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 1 No. 2 (2016); 70-75</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 1 No 2 (2016); 70-75</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v1i2</dc:source>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v1i22/pdf</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2016 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/45</identifier>
				<datestamp>2023-07-24T09:19:59Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Rancang Bangun Pengontrol Presentasi Berbasis Slide dengan Teknik Analisis Gerakan Jari dan Tangan</dc:title>
	<dc:creator>Harika, Maisevli</dc:creator>
	<dc:creator>Ramdania, Diena Rauda</dc:creator>
	<dc:subject xml:lang="id-ID">computer vision</dc:subject>
	<dc:subject xml:lang="id-ID">deteksi jari</dc:subject>
	<dc:subject xml:lang="id-ID">deteksi tangan</dc:subject>
	<dc:subject xml:lang="id-ID">HCI</dc:subject>
	<dc:subject xml:lang="id-ID">kendali gerakan tangan</dc:subject>
	<dc:subject xml:lang="id-ID">slide presentasi</dc:subject>
	<dc:description xml:lang="id-ID">Gerakan tangan mampu membantu proses berpikir karena memberikan gambaran visual pada pembicara. Memanfaatkan gerakan untuk mengendalikan presentasi berbasis slide merupakan hal yang bermanfaat dan memudahkan pembicara. Analisis gerakan tangan dalam sinar proyektor sulit dilakukan karena artikulasi tangan, occlusion, dan pencahayaan yang berubah-ubah. Pendekatan yang diajukan dalam jurnal ini didesain untuk mengendalikan presentasi berbasis slide dan pointer dengan tangan kosong.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2016-12-31</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v1i21</dc:identifier>
	<dc:identifier>10.15575/join.v1i2.45</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 1 No. 2 (2016); 64-69</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 1 No 2 (2016); 64-69</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v1i2</dc:source>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v1i21/pdf_2</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2016 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header status="deleted">
				<identifier>oai:ojs.join.if.uinsgd.ac.id:article/60</identifier>
				<datestamp>2024-05-27T15:00:52Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/63</identifier>
				<datestamp>2025-08-17T09:44:01Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Kombinasi Firefly Algorithm-Tabu Search untuk Penyelesaian Traveling Salesman Problem</dc:title>
	<dc:creator>Hay&#039;s, Riyan Naufal</dc:creator>
	<dc:subject xml:lang="id-ID">Firefly Algorithm</dc:subject>
	<dc:subject xml:lang="id-ID">Tabu Search</dc:subject>
	<dc:subject xml:lang="id-ID">Traveling Salesman Problem</dc:subject>
	<dc:description xml:lang="id-ID">Traveling Salesman Problem (TSP) adalah masalah optimasi kombinatorial klasik dan memiliki peran dalam perencanaan, penjadwalan, dan pencarian pada bidang rekayasa dan pengetahuan. TSP juga merupakan objek yang baik untuk menguji kinerja metode optimasi, beberapa metode seperti Cooperative Genetic Ant System (CGAS), Parallelized Genetic Ant Colony System (PGAS) Particle Swarm Optimization and Ant Colony Optimization Algorithms (PSO–ACO), dan Ant Colony Hyper-Heuristics (ACO HH) telah dikembangkan untuk memecahkan TSP. Sehingga, pada penelitian ini diimplementasikan kombinasi metode baru untuk meningkatkan akurasi penyelesaian TSP. Firefly Algorithm (FA) merupakan salah satu algoritma yang dapat digunakan untuk memecahkan masalah optimasi kombinatorial. FA merupakan algoritma yang berpotensi kuat dalam memecahkan kasus optimasi dibanding algoritma yang ada termasuk Particle Swarm Optimization. Namun, FA memiliki kekurangan dalam memecahkan masalah optimasi dengan skala besar. Tabu Search (TS) merupakan metode optimasi yang terbukti efektif untuk memecahkan masalah optimasi dengan skala besar. Pada penelitian ini, TS akan diterapkan pada FA (FATS) untuk memecahkan kasus TSP. Hasil FATS akan dibandingkan terhadap penelitian sebelumnya yaitu ACOHH. Perbandingan hasil menunjukan peningkatan akurasi sebesar 0.89% pada dataset Oliver30, 0.14% dataset Eil51, 3.81% dataset Eil76 dan 1.27% dataset KroA100.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2017-07-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v2i18</dc:identifier>
	<dc:identifier>10.15575/join.v2i1.63</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 2 No. 1 (2017); 42-48</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 2 No 1 (2017); 42-48</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v2i1</dc:source>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v2i18/63-pdf</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 Jurnal Online Informatika</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/70</identifier>
				<datestamp>2025-08-17T09:44:01Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Implementasi Business Intelligence untuk Menganalisis Data Persalinan Anak di Klinik Ani Padang dengan Menggunakan Aplikasi Tableau Public</dc:title>
	<dc:creator>Zikri, Afdhal</dc:creator>
	<dc:creator>Adrian, Jovi</dc:creator>
	<dc:creator>Soniawan, Azizi</dc:creator>
	<dc:creator>Azim, Rafki</dc:creator>
	<dc:creator>Dinur, Rafel</dc:creator>
	<dc:creator>Akbar, Ricky</dc:creator>
	<dc:subject xml:lang="id-ID">Business Intelligence</dc:subject>
	<dc:subject xml:lang="id-ID">Data Warehouse</dc:subject>
	<dc:subject xml:lang="id-ID">Tableau Public</dc:subject>
	<dc:subject xml:lang="id-ID">Tren</dc:subject>
	<dc:description xml:lang="id-ID">Orang tunarungu berkomunikasi dengan cara menggunakan bahasa isyarat. Sulitnya orang tunarungu berkomunikasi dengan orang normal menjadi salah satu permasalahan yang cukup serius, karena apabila orang normal tidak mengerti bahasa isyarat maka ketika berkomunikasi dengan orang tunarungu akan ada kesalahan komunikasi, sehingga keinginan orang tunarungu tidak akan tersampaikan dengan baik. Salah satu cara memecahkan masalah dalam hal ini yaitu orang normal berlajar bahasa isyarat, untuk membuat orang normal lebih tertarik belajar bahasa isyarat yaitu dengan cara memanfaatkan perkembangan teknologi salah satunya penerapan teknologi Augmented Reality yang pada saat ini sedang banyak di bicarakan dalam perkembangan teknologi multimedia. Berdasarkan permasalahan yang ada maka di buat sebuah aplikasi dengan menerapan teknologi Augmented Realitytersebutpada aplikasi yang dibuat yaitu aplikasi konversi bahasa isyarat abjad dan angkadengan menggunakan teknik 3D Object Tracking yaitu salah satu fitur terbaru dalam metode markerless, pada teknik ini marker tidak lagi menyerupai kertas melainkan objek 3 dimensi seperti asbak, mainan mobil –mobilan, dan lain sebagainya. Marker yang di gunakan dalam aplikasi konversi bahasa isyarat yaitu abjad dan angka dalam bentuk kayu dengan ukuran 10x8 cm, pada kayu tersebut di terapkan warna –warna yang terang. Melakukan scanningmarker dilakukan di tempat yang terang karena pada pembuatan marker 3D Object Tracking intensitas cahaya menjadi salah satu keberhasilan terdeteksinya marker.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2017-07-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:format>application/vnd.ms-excel</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v2i14</dc:identifier>
	<dc:identifier>10.15575/join.v2i1.70</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 2 No. 1 (2017); 20-24</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 2 No 1 (2017); 20-24</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v2i1</dc:source>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v2i14/70-pdf</dc:relation>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v2i14/249</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 Jurnal Online Informatika</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/71</identifier>
				<datestamp>2025-08-17T09:44:01Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Analisa dan Penerapan Algoritma C4.5 Dalam Data Mining Untuk Mengidentifikasi Faktor-Faktor Penyebab Kecelakaan Kerja Kontruksi PT.Arupadhatu Adisesanti</dc:title>
	<dc:creator>elisa, erlin</dc:creator>
	<dc:subject xml:lang="id-ID">Kecelakaan Kerja</dc:subject>
	<dc:subject xml:lang="id-ID">Data Mining</dc:subject>
	<dc:subject xml:lang="id-ID">Klasifikasi</dc:subject>
	<dc:subject xml:lang="id-ID">Algoritma C4.5</dc:subject>
	<dc:description xml:lang="id-ID">Kecelakaan merupakan suatu kejadian yang tidak terencana begitupun pada sebuah proyek konstruksi dimana kecelakaan sering terjadi hal ini disebabkan oleh berbagai faktor. Kita lihat pada Â Industri jasa konstruksi yang merupakan salah satu sektor industri yang memiliki risiko kecelakaan kerja yang cukup tinggi. Banyaknya kecelakaan kerja yang terjadi tidak terlepas dari faktor Human Error, tentunya berdampak pada kinerja dan pekerjaan yang dilaksanakan, Metode yang digunakan dalam analisis ini adalah Algoritma C4.5 yang merupakan salah satu algoritma modern untuk melakukan Data Mining, Algoritma C4.5 disebut juga dengan pohon keputusan (decision tree) yaitu merupakan salah satu metode klasifikasi yang menggunakan representasi struktur pohon, dan pada setiap node merepresentasikan atribut,cabangnya merepresentasikan nilai dari atribut, dan daun merepresentasikan kelas, Konsep dari pohon keputusan ini adalah dengan mengumpulkan data selanjutnya dibuatkan decision tree yang kemudian akan dihasilkan rule-rule solusi permasalahan. dari hasil penelitian faktor-faktor yang menjadi penyebab terjadinya kecelakaan kerja kontrusksi yang sering terjadi adalah Lingkungan Tempat Kerja, Rambu-Rambu Keselamatan dan Pekerja dan Cara kerja.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2017-07-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v2i17</dc:identifier>
	<dc:identifier>10.15575/join.v2i1.71</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 2 No. 1 (2017); 36-41</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 2 No 1 (2017); 36-41</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v2i1</dc:source>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v2i17/71-pdf</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 Jurnal Online Informatika</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/74</identifier>
				<datestamp>2025-08-17T09:44:01Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Penerapan Logika Fuzzy  Pada Penilaian Mutu Dosen  Terhadap Tri Dharma Perguruan Tinggi</dc:title>
	<dc:creator>Adiguna, Mochamad Adhari</dc:creator>
	<dc:creator>Muhajirin, Adi</dc:creator>
	<dc:subject xml:lang="id-ID">Logika Fuzzy</dc:subject>
	<dc:subject xml:lang="id-ID">Penilaian Mutu Dosen</dc:subject>
	<dc:subject xml:lang="id-ID">Tri Dharma Perguruan Tinggi</dc:subject>
	<dc:description xml:lang="id-ID">Tri Dharma Perguruan Tinggi merupakan kegiatan yang harus dilakukan oleh setiap Dosen, karena hal tersebut termasuk beban kerja Dosen sesuai peraturan Presiden No 4 Tahun 2014 RI. Dalam pelaksanaannya, Perguruan Tinggi memiliki peran penting agar dapat mendukung dan mengevaluasi kegiatan tersebut. Salah satu evaluasi yang dapat digunakan yaitu penilaian mutu Dosen terhadap beban kerja Dosen tersebut. Pada penelitian ini dirancang aplikasi untuk menerapkan logika Fuzzy untuk perhitungan nilai mutu Dosen terhadap pelaksanaan Tri Dharma Perguruan Tinggi. Latar belakang dari penelitian ini ingin mengetahui hasil yang didapat dari penerapan dan perhitungan menggunakan logika Fuzzy, juga membantu evaluasi Dosen pada bidang pengendali mutu. Pada penerapannya digunakan 27 aturan/rules untuk komposisi aturannya, himpunan Fuzzy dengan semesta dan aplikasi fungsi implikasi pada satu kondisi nilai yang selanjutnya dihitung menggunakan penalaran/inferensi dan defuzzifikasi. Batasan masalah dari penelitian ini menerapkan logika Fuzzy pada variabel pendidikan, penelitian dan pengabdian sehingga menghasilkan output yang sesuai. Adapun logika Fuzzy yang digunakan yaitu Fuzzy mamdani. Hasil pengujian pada aplikasi menunjukan 100% bekerja dengan baik, selisih nilai antara pengujian dan penalaran, hasil pengujian 2,36 lebih kecil dari hasil penalaran.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2017-07-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v2i13</dc:identifier>
	<dc:identifier>10.15575/join.v2i1.74</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 2 No. 1 (2017); 16-19</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 2 No 1 (2017); 16-19</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v2i1</dc:source>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v2i13/74-pdf</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/79</identifier>
				<datestamp>2025-08-17T09:44:01Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Kompresi Citra Dengan Menggabungkan Metode Discrete Cosine Transform (DCT) dan Algoritma Huffman</dc:title>
	<dc:creator>Krasmala, Raras</dc:creator>
	<dc:creator>Budimansyah, Arif</dc:creator>
	<dc:creator>Lenggana, U. Tresna</dc:creator>
	<dc:subject xml:lang="id-ID">DCT</dc:subject>
	<dc:subject xml:lang="id-ID">Huffman</dc:subject>
	<dc:subject xml:lang="id-ID">Lossy Compression</dc:subject>
	<dc:description xml:lang="id-ID">Penelitian ini bertujuan untuk mengkompresi citra dengan menggabungkan metode DCT dan Algoritma Huffman untuk membuat kapasitas file gambar menjadi kecil sehingga dapat menghemat media penyimpanan dan tidak lambat jika pengiriman citra dari satu tempat ke tempat lain. Discrete Cosine Transform (DCT) adalah sebuah teknik yang mengubah sinyal ke dalam komponen frekwensi dasar dan Algoritma Huffman adalah algoritma yang digunakan untuk membuat kompresi jenis lossy compression yaitu penempatan data dimana tidak ada satu byte pun data yang hilang sehingga data tersebut utuh dan disimpan sesuai dengan aslinya. Dengan menggabungkan metode Discrete Cosine Transform (DCT) dan Algoritma Huffman dapat mengkompresi gambar dengan maksimal. Dengan teknik lossy compression pada DCT, kompresi citra yang dihasilkan sedikit mengurangi warna (pixel) namun tampak tidak terlihat perbedaannya dengancitra asli sebelum dikompresi. Hasil kompresi tergantung pada pemilihan kualitas kompresi yang diinginkan. Jika memilih kompresi dengan kualitas standar, maka citra hasil kompresi dengan citra yang asli tidak akan terlihat perbedaannya namun pengurangan ukuran bytes tidak terlalu drastis. Tetapi apabila kita memilih kualitas kompresi rendah, maka ukuran bytes pada citra akan berkurang namun kualitas gambar hasil kompresi akan terlihat perbedaannya dengan citra asli.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2017-07-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v2i11</dc:identifier>
	<dc:identifier>10.15575/join.v2i1.79</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 2 No. 1 (2017); 1-9</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 2 No 1 (2017); 1-9</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v2i1</dc:source>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v2i11/79-pdf</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 Jurnal Online Informatika</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/82</identifier>
				<datestamp>2025-08-17T09:44:01Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Rancang Bangun Aplikasi Konversi Bahasa Isyarat Ke Abjad dan Angka Berbasis Augmented Reality dengan Teknik 3D Object Tracking</dc:title>
	<dc:creator>Annisa, Ane</dc:creator>
	<dc:creator>Hiron, Nurul</dc:creator>
	<dc:creator>Khairul Anshary, Muhammad Adi</dc:creator>
	<dc:subject xml:lang="id-ID">3D Object Tracking</dc:subject>
	<dc:subject xml:lang="id-ID">Augmented Reality</dc:subject>
	<dc:subject xml:lang="id-ID">Bahasa Isyarat</dc:subject>
	<dc:subject xml:lang="id-ID">Tunarungu</dc:subject>
	<dc:description xml:lang="id-ID">Orang tunarungu berkomunikasi dengan cara menggunakan bahasa isyarat. Sulitnya orang tunarungu berkomunikasi dengan orang normal menjadi salah satu permasalahan yang cukup serius, karena apabila orang normal tidak mengerti bahasa isyarat maka ketika berkomunikasi dengan orang tunarungu akan ada kesalahan komunikasi, sehingga keinginan orang tunarungu tidak akan tersampaikan dengan baik. Salah satu cara memecahkan masalah dalam hal ini yaitu orang normal berlajar bahasa isyarat, untuk membuat orang normal lebih tertarik belajar bahasa isyarat yaitu dengan cara memanfaatkan perkembangan teknologi salah satunya penerapan teknologi Augmented Reality yang pada saat ini sedang banyak di bicarakan dalam perkembangan teknologi multimedia. Berdasarkan permasalahan yang ada maka di buat sebuah aplikasi dengan menerapan teknologi Augmented Reality tersebut pada aplikasi yang dibuat yaitu aplikasi konversi bahasa isyarat abjad dan angkadengan menggunakan teknik 3D Object Tracking Â yaitu salah satu fitur terbaru dalam metode markerless, pada teknik ini marker tidak lagi menyerupai kertas melainkan objek 3 dimensi seperti asbak, mainan mobil â€“ mobilan, dan lain sebagainya. Marker yang di gunakan dalam aplikasi konversi bahasa isyarat yaitu abjad dan angka dalam bentuk kayu dengan ukuran 10x8 cm, pada kayu tersebut di terapkan warna â€“ warna yang terang. Penyecanan marker dilakukan di tempat yang terang karena pada pembuatan marker 3D Object Tracking intensitas cahaya menjadi salah satu keberhasilan terdeteksinya marker.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2017-07-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v2i15</dc:identifier>
	<dc:identifier>10.15575/join.v2i1.82</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 2 No. 1 (2017); 25-29</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 2 No 1 (2017); 25-29</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v2i1</dc:source>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v2i15/82-revpdf</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/85</identifier>
				<datestamp>2025-08-17T09:44:01Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Deteksi Keaslian Video Pada Handycam Dengan Metode Localization Tampering</dc:title>
	<dc:creator>Sari, Dewi Yunita</dc:creator>
	<dc:subject xml:lang="id-ID">Handycam</dc:subject>
	<dc:subject xml:lang="id-ID">Histogram</dc:subject>
	<dc:subject xml:lang="id-ID">Frame</dc:subject>
	<dc:subject xml:lang="id-ID">Tampering</dc:subject>
	<dc:subject xml:lang="id-ID">Video</dc:subject>
	<dc:description xml:lang="id-ID">Video merupakan barang bukti digital yang salah satunya berasal dari handycam, dalam hal kejahatan video biasanya dimanipulasi untuk menghilangkan bukti-bukti yang ada di dalamnya, oleh sebab itu diperlukan analisis forensik untuk dapat mendeteksi keaslian video tersebut. Dalam penelitian ini di lakukan manipulasi video dengan attack cropping, zooming, rotation, dan grayscale, hal ini bertujuan untuk membandingkan antara rekaman video asli dan rekaman video tampering, dari rekaman video tersebut dianalisis dengan menggunakann metode localization tampering, yaitu metode deteksi yang menunjukkan bagian pada video yang telah dimanipulasi, dengan menganalisis frame, perhitungan histogram, dan grafik histogram. Dengan localization tampering tersebut maka dapat diketahui letak frame dan durasi pada video yang telah mengalami tampering.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2017-07-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v2i12</dc:identifier>
	<dc:identifier>10.15575/join.v2i1.85</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 2 No. 1 (2017); 10-15</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 2 No 1 (2017); 10-15</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v2i1</dc:source>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v2i12/85-pdf</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 Jurnal Online Informatika</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/87</identifier>
				<datestamp>2025-08-17T09:44:01Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Rancang Bangun Sistem Pakar Diagnosa tingkat Depresi Pada Mahasiswa Tingkat Akhir Menggunakan Metode Fuzzy Tsukamoto(Studi Kasus : Universitas Siliwangi)</dc:title>
	<dc:creator>Kurniati, Neng Ika</dc:creator>
	<dc:creator>Mubarok, Husni</dc:creator>
	<dc:creator>Reinaldi, Angga</dc:creator>
	<dc:subject xml:lang="id-ID">Depresi</dc:subject>
	<dc:subject xml:lang="id-ID">Sistem Pakar</dc:subject>
	<dc:subject xml:lang="id-ID">Logika Fuzzy</dc:subject>
	<dc:subject xml:lang="id-ID">Tsukamoto</dc:subject>
	<dc:description xml:lang="id-ID">Depresi adalah penyakit mental yang umum tapi serius biasanya ditandai dengan perasaan sedih atau cemas. Kebanyakan mahasiswa kadang-kadang merasa sedih atau cemas, tapi emosi ini biasanya berlalu dengan cepat dalam beberapa hari. Depresi yang tidak diobati berlangsung untuk waktu yang lama, mengganggu kegiatan sehari-hari, dan jauh lebih dari sekedar &quot;sedikit murung&quot; atau &quot;merasa sedih&quot;. Pada tahun 2011, Asosiasi Kesehatan American College National College Health Assessment(ACHA-NCHA) sebuah survei nasional pada mahasiswa di dua dan empat lembaga menemukan bahwa sekitar 30 persen dari mahasiswa melaporkan merasa &quot;begitu tertekan sehingga sulit untuk berfungsi&quot; pada beberapa waktu dalam satu tahun terakhir. Dengan dasar tersebut maka diperlukan sebuah sistem pakar untuk membantu mahasiswa dalam mendeteksi tingkat depresi. Adapun sistem pakar yang dibuat dalam pembuatan sistem pakar ada tiga tahap utama dalam pengembangan softwareini: fuzzifikasi, inferensi dan defuzzifikasi, menggunakan Tsukamoto pada tahap inference. Pada tahap defuzzifikasi, Center Average Deffuzzyfier digunakan untuk mendapatkan aturan output crisp. Basis Aturan yang digunakan dalam penelitian ini sebanyak 64 aturan. Adapun sistem pakar yang dibangun menggunakan metode Fuzzy Tsukamoto sebagai metode penalaran untuk menentukan hasil deteksi berdasarkan gejala yang ditunjukkan. Sistem pakar ini dibangun berbasis Desktop agar dapat digunakan oleh mahasiswa dan instansi/lembaga yang membutuhkan. Berdasarkan pengujian yang dilakukan, sistem pakar ini valid dengan tingkat akurasi sebesar 96% dalam memberikan hasil deteksi yang sesuai dengan pakar,dari hasil data sebanyak 25 percobaan. Selain itu sistem dapat beroperasi baik.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2017-07-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v2i19</dc:identifier>
	<dc:identifier>10.15575/join.v2i1.87</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 2 No. 1 (2017); 49-55</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 2 No 1 (2017); 49-55</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v2i1</dc:source>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v2i19/87-pdf</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 Jurnal Online Informatika</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/88</identifier>
				<datestamp>2025-08-17T09:44:01Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Prediksi Spasial Perkembangan Lahan Terbangun Melalui Pemanfaatan Citra Landsat Multitemporal di Kota Bogor</dc:title>
	<dc:creator>Zahrotunisa, Siti</dc:creator>
	<dc:subject xml:lang="id-ID">Prediksi spasial</dc:subject>
	<dc:subject xml:lang="id-ID">Kota Bogor</dc:subject>
	<dc:description xml:lang="id-ID">Proses ekspansi lahan terbangun tanpa kontrol sering berimbas pada hilangnya lahan-lahan yang memiliki fungsi ekologis dan kemudian berdampak pada munculnya masalah lingkungan. Salah satu hal yang dapat dilakukan untuk mencegah dampak buruk dari perkembangan lahan terbangun adalah memonitor dan memprediksi perkembangannya, sehingga dapat dicarikan solusi sebelum dampak buruk tersebut terjadi. Kota bogor merupakan salah satu daerah yang mengalami ekspansi lahan terbangun daru waktu ke waktu. Penelitian ini bertujuan untuk memprediksi perkembangan lahan terbangun di Kota Bogor dan sekitarnya dengan memanfaatkan variabel- variabel yang mempengaruhi perkembangan kota. Data penginderaan jauh multitemporal memiliki keunggulan untuk keperluan monitoring yang lebih efektif dibandingkan dengan pengamatan langsung di lapangan. Data yang digunakan adalah citra Landsat multi temporal yaitu Landsat 8 OLI/TIRS perekaman 17 Agustus 2016 dan Landsat 7ETM+ perekaman 22 Oktober 2002. Pemodelan yang digunakan adalah Landuse Change Modeler pada perangkat lunak IDRISI. Berdasarkan analisis yang telah dilakukan, cubic trend menunjukkan arah perkembangan lahan non terbangun menjadi lahan terbangun yaitu ke arah selatan, dari tahun 2002 hingga 2016 lahan terbangun terus meningkat sedangkan lahan non terbangun terus berkurang, variabel yang paling berpengaruh dalam perkembangan lahan terbangun adalah jalan non utama, dan hasil prediksi pada tahun 2031 Kota Bogor dan sekitarnya mengalami peningkatan lahan terbangun yang pesat dibandingkan tahun 2016 kerarah selatan dan tenggaran dengan peluang perubahan lahan non terbangun menjadi terbangun sebesar 0.3241.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2017-07-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v2i16</dc:identifier>
	<dc:identifier>10.15575/join.v2i1.88</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 2 No. 1 (2017); 30-35</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 2 No 1 (2017); 30-35</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v2i1</dc:source>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v2i16/88-pdf</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/97</identifier>
				<datestamp>2025-08-17T09:44:20Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Penerapan Algoritma Nearest Neighbor dan CBR pada Expert System Penyimpangan Perilaku Seksual</dc:title>
	<dc:creator>Salamun, Salamun</dc:creator>
	<dc:subject xml:lang="id-ID">Nearest Neighbor</dc:subject>
	<dc:subject xml:lang="id-ID">CBR</dc:subject>
	<dc:subject xml:lang="id-ID">Sistem Pakar</dc:subject>
	<dc:description xml:lang="id-ID">Dalam membangun sebuah sistem yang terkomputerisasi khususnya sistem pakar, sangat dibutuhkan sebuah inovasi-inovasi demi mendapatkan hasil yang lebih baik. Dalam kasus ini membahas tentang penerapan algoritma nearest neighbor dan metode Case-Based Reasoning (CBR), dimana algoritma nearest neighbor berfungsi untuk mengklasifikasikan masalah yang ada sedangkan CBR berfungsi sebagai alat untuk penyelesaian masalah yang sudah diklasifikasikan dengan algoritma nearest neighbor. CBR merupakan metode yang memiliki cara kerja yang unik, yaitu penalaran berbasis kasus, dimana hasil dari kasus yang sudah di analisa didapatkan dari kasus yang sudah pernah terjadi sebelumnya. Dalam artian, metode ini merupakan metode yang dapat mengambil kesimpulan berdasarkan pengalaman sebelumnya. Dalam kasus ini membahas tentang perilaku seksual yang menyimpang pada kaum LGBT khususnya kaum laki-laki, dimana hasil dari penelitian ini didapatkan berupa jenis-jenis penyimpangan dan tingkat penyimpangan yang dilakukan oleh komunitas LGBT, sistem pakar ini dapat membantu psikolog untuk mencari dan menganalisa kasus yang ada serta memberikan saran dan masukan kepada penderita yang memiliki penyimpangan perilaku seksual.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2018-01-06</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v2i21</dc:identifier>
	<dc:identifier>10.15575/join.v2i2.97</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 2 No. 2 (2017); 63-70</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 2 No 2 (2017); 63-70</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v2i2</dc:source>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v2i21/68</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/100</identifier>
				<datestamp>2025-08-17T09:44:20Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Aplikasi Pengenalan Bahasa Arab dan Inggris untuk Anak-Anak Berbasis Android</dc:title>
	<dc:creator>Septian, Hilman</dc:creator>
	<dc:creator>Hidayat, Eka Wahyu</dc:creator>
	<dc:creator>Rahmatulloh, Alam</dc:creator>
	<dc:subject xml:lang="id-ID">Android</dc:subject>
	<dc:subject xml:lang="id-ID">Bahasa Arab</dc:subject>
	<dc:subject xml:lang="id-ID">Bahasa Inggris</dc:subject>
	<dc:subject xml:lang="id-ID">Multimedia</dc:subject>
	<dc:subject xml:lang="id-ID">Smartphone</dc:subject>
	<dc:description xml:lang="id-ID">Bahasa adalah alat komunikasi yang paling penting bagi manusia, karena bahasa berfungsi sebagai alat penyampai pesan dari seseorang kepada orang lain. Salah satu bahasa yang popular di kalangan masyarakat Indonesia adalah bahasa Inggris dan bahasa Arab. Pembelajaran bahasa dengan cara konvensional biasanya dilakukan dengan cara tatap muka langsung dengan guru di sekolah atau di majelis ilmu. Adanya teknologi berbasis mobile saat ini yang sedang populer yaitu Android dapat membantu proses pembelajaran bahasa, sehingga pembelajaran bahasa inggris dan arab dapat dituangkan pada bentuk digital. Pada penelitian ini akan membuat aplikasi pengenalan bahasa Inggris dan Arab dengan menuangkan multimedia menurut konsep Luther-Sutopo, sehingga diharapkan pembelajaran bisa lebih praktis dan menarik. Metode Luther-Sutopo digunakan untuk rekayasa multimedia, dengan tahapan concept, design, material collecting, assembly, testing dan distribution. Hasil dari penelitian ini menghasilkan sebuah aplikasi multimedia pengenalan bahasa berbasis Android yang telah diuji, berdasarkan pengujian alpha didapat bahwa secara fungsional sudah sesuai dengan fungsinya dan dari pengujian beta didapat nilai 87%, yang artinya aplikasi di interpretasi sangat baik oleh pengguna.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2018-01-06</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v2i22</dc:identifier>
	<dc:identifier>10.15575/join.v2i2.100</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 2 No. 2 (2017); 71-78</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 2 No 2 (2017); 71-78</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v2i2</dc:source>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v2i22/69</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/101</identifier>
				<datestamp>2025-08-17T09:44:20Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Sistem Pendukung Keputusan Penerimaan Beasiswa Bidik Misi di POLIBAN dengan Metode SAW Berbasis Web</dc:title>
	<dc:creator>Fauzan, Reza</dc:creator>
	<dc:creator>Indrasary, Yoenie</dc:creator>
	<dc:creator>Muthia, Nonik</dc:creator>
	<dc:subject xml:lang="id-ID">Alternatif penerima beasiswa</dc:subject>
	<dc:subject xml:lang="id-ID">Simple Additive Weighting (SAW)</dc:subject>
	<dc:subject xml:lang="id-ID">Sistem Pendukung Keputusan</dc:subject>
	<dc:description xml:lang="id-ID">Program beasiswa Bidik Misi adalah program bantuan biaya pendidikan bagi calon mahasiswa tidak mampu secara ekonomi dan memiliki potensi akademik baik untuk menempuh pendidikan di perguruan tinggi. Penerima Beasiswa Bidik Misi ditentukan berdasarkan kriteria tertentu. Sistem pendukung keputusan merupakan sebuah sistem yang digunakan untuk menentukan alternatif penerima Beasiswa Bidik Misi di Politeknik Negeri Banjarmasin yang paling mendekati kriteria yang telah ditentukan dengan menggunakan metode Simple Additive Weighting (SAW). Konsep dasar dari metode Simple Additive Weighting ini adalah mencari penjumlahan terbobot dari rating kinerja pada setiap alternatif pada semua kriteria. Pengujian dilakukan dengan data baru (data uji) dari alternatif penerima Beasiswa Bidik Misi data uji tersebut dinormalisasi sesuai dengan jenis atribut kriteria (benefit atau cost). Hasil akhir diperoleh dari proses perhitungan, yaitu penjumlahan dari matriks ternormalisasi dengan bobot per kriteria yang menunjukkan rangking alternatif penerima beasiswa dari yang paling mendekati kriteria hingga yang paling jauh dari kriteria. Dari sana lah didapat alternatif yang kemudian mendapat Beasiswa Bidik Misi.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2018-01-06</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v2i23</dc:identifier>
	<dc:identifier>10.15575/join.v2i2.101</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 2 No. 2 (2017); 79-83</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 2 No 2 (2017); 79-83</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v2i2</dc:source>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v2i23/70</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/102</identifier>
				<datestamp>2025-08-17T09:44:01Z</datestamp>
				<setSpec>join:Front</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Cover Depan JOIN Vol. 2 No. 1</dc:title>
	<dc:creator>JOIN, Admin</dc:creator>
	<dc:description xml:lang="en-US">-</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2017-07-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/102</dc:identifier>
	<dc:identifier>10.15575/join.v2i1.102</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 2 No. 1 (2017)</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 2 No 1 (2017)</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v2i1</dc:source>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/102/61</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/103</identifier>
				<datestamp>2025-08-17T09:44:01Z</datestamp>
				<setSpec>join:Back</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Cover Belakang JOIN Vol. 2 No. 1</dc:title>
	<dc:creator>JOIN, Admin</dc:creator>
	<dc:description xml:lang="en-US">-</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2017-07-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/103</dc:identifier>
	<dc:identifier>10.15575/join.v2i1.103</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 2 No. 1 (2017)</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 2 No 1 (2017)</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v2i1</dc:source>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/103/62</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/107</identifier>
				<datestamp>2025-08-17T09:44:20Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Aplikasi Bagi Waris Islam dengan Metode Forward Chaining berbasis Web</dc:title>
	<dc:creator>Minarni, Desi</dc:creator>
	<dc:creator>Isa, Indra Griha Tofik</dc:creator>
	<dc:creator>Yanik, Asri</dc:creator>
	<dc:subject xml:lang="id-ID">Sistem Pakar</dc:subject>
	<dc:subject xml:lang="id-ID">Waris Islam</dc:subject>
	<dc:subject xml:lang="id-ID">Forward Chaining</dc:subject>
	<dc:subject xml:lang="id-ID">Web Application</dc:subject>
	<dc:description xml:lang="id-ID">Pembagian waris Islam yang dilakukan masyarakat saat ini masih memerlukan pihak ketiga atau seorang pakar yang membantu menghitung pembagian waris. Perhitungan waris yang dilakukan secara manual seperti menghitung data ahli waris satu persatu besar kemungkinan akan terjadinya kesalahan dalam hasil perhitungan yang terjadi akibat kelalaian manusia,. Aplikasi Bagi Waris Islam ini dirancang sebagai aplikasi berbasis web dengan bahasa pemrograman PHP, MySQL yang membantu masyarakat dalam mempelajari ilmu faraidh dan atau menghitung warisan keluarga. Dalam aplikasi ini masyarakat dapat mengetahui langsung dalil-dalil yang menjadi dasar diambilnya keputusan. Proses perhitungan dilakukan menggunakan metode forward chaining, dimana keputusan dapat diambil ketika data-data sudah terkumpul dan dimasukan kedalam aplikasi. Aplikasi ini diharapkan dapat membantu mempermudah masyarakat untuk mempelajari serta melakukan proses perhitungan bagi waris sesuai dengan aturan yang terdapat dalam Al-quran.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2018-01-06</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:format>application/msword</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v2i210</dc:identifier>
	<dc:identifier>10.15575/join.v2i2.107</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 2 No. 2 (2017); 127-133</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 2 No 2 (2017); 127-133</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v2i2</dc:source>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v2i210/80</dc:relation>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v2i210/250</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/109</identifier>
				<datestamp>2025-08-17T09:44:20Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Pengenalan Wajah Menggunakan SVM Multi Kernel dengan Pembelajaran yang Bertambah</dc:title>
	<dc:creator>Athoillah, Muhammad</dc:creator>
	<dc:subject xml:lang="id-ID">Multi Kernel</dc:subject>
	<dc:subject xml:lang="id-ID">Pembelajaran yang Bertambah</dc:subject>
	<dc:subject xml:lang="id-ID">Pengenalan Wajah</dc:subject>
	<dc:subject xml:lang="id-ID">SVM</dc:subject>
	<dc:description xml:lang="id-ID">Pengenalan wajah secara otomatis merupakan sebuah kebutuhan yang memiliki peran penting dalam kehidupan masyarakat saat ini. Pada dasarnya masalah pengenalan wajah dapat di pecahkan dengan menggunakan algoritma atau metode klasifikas, salah satunya adalah Support Vector Machine (SVM). Walaupun sangat baik dalam menyelesaikan permasalahan klasifikasi, SVM hanya dapat digunakan pada data yang bersifat linear saja, sehingga untuk dapat digunakan pada data non-linear maka SVM dimodifikasi dengan menggunakan fungsi kernel. Sulitnya menemukan fungsi kernel yang sesuai dengan karakteristik data yang dipakai membuat para peneliti melakukan pengembangan dengan menggunakan kombinasi dari beberapa kernel atau disebut Multi kernel. Pada penelitian ini dibangun sebuah sistem pengenalan wajah yang berbasis SVM multi kernel dengan metode pembelajaran yang bertambah, artinya apabila terjadi penambahan data atau informasi baru tidak harus menghapus pengetahuan yang lalu dan mengulang pembelajarannya dari awal. Sehingga pembelajaran sistem yang dibangun lebih dinamis. Hasil yang didapat pada penelitian ini menunjukkan bahwa sistem yang dibangun dapat mengenali wajah manusia dengan baik, hal ini dibuktikan dengan nilai rata-rata keseluruhanÂ  akurasi yang mencapai 89%, kemudian nilai precision 41.67% serta nilai recall sebesar 47.67%. Hasil penelitian juga menunjukkan bahwa dengan metode pembelajaran yang bertambah, sistem hanya membutuhkan waktu selama 6.4853 detik secara rata-rata pada keseluruhan uji coba.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2018-01-06</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v2i24</dc:identifier>
	<dc:identifier>10.15575/join.v2i2.109</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 2 No. 2 (2017); 84-91</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 2 No 2 (2017); 84-91</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v2i2</dc:source>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v2i24/81</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/110</identifier>
				<datestamp>2025-08-17T09:44:20Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Implementasi Metode Scoring System  Sebagai Paramater dalam Memahami Kajian Ilmu Tasawuf Berbasis Android</dc:title>
	<dc:creator>Hermayanti, Pungky</dc:creator>
	<dc:creator>Budimansyah, Arif</dc:creator>
	<dc:creator>Lenggana, Ujang Tresna</dc:creator>
	<dc:subject xml:lang="id-ID">Tasawuf</dc:subject>
	<dc:subject xml:lang="id-ID">Android</dc:subject>
	<dc:subject xml:lang="id-ID">Metode Scoring System</dc:subject>
	<dc:description xml:lang="id-ID">Ilmu tasawuf merupakan bagian dari syariat islam. Syariat dalam makna umum adalah keseluruhan ajaran islam. Tidak hanya ilmu tauhid dan ilmu fiqih yang harus dipelajari, tetapi ilmu tasawuf ini merupakan ilmu yang tidak dapat terpisahkan dari ilmu fiqih dan ilmu tauhid. Ilmu tasawuf adalah ilmu untuk mengetahui bagaimana cara mensucikan jiwa. Ilmu tasawuf didalam pembelajarannya berbeda dengan kedua displin ilmu tersebut, karena ilmu tasawuf bukan ilmu yang sekedar menghapal, tetapi juga ilmu yang harus diimplementasikan sehingga meresap ke dalam keruhanian seorang muslim dengan bimbingan seorang guru mursyid. Dalam pelaksanaannya, umat muslim membutuhkan bimbingan baik secara langsung maupun tidak langsung ataupun baik lahiriah maupun batiniah. Bimbingan secara lahiriah ini akan dapat diterapkan secara praktis dan bersifat mobile dengan menggunakan media android sebagai jembatan memahami ilmu tasawuf. Oleh karena itu, pada penelitian ini telah diimplementasikanÂ  menggunakan metode scoring system Â sebagai parameter dalam memahami kajian ilmu tasawuf berbasis android. Yang dilengkapi dengan latihan kemampuan pemahaman kajian mengenai ilmu tasawuf. Tujuannya adalah mampu meningkatkan kualitas keimanan seseorang dan mampu meningkatkanÂ  pemahaman kajian tasawuf, yang Sistem penilaiannya menggunakan metode pengukuran, yaitu metode scoring system. Metode scoring system adalah metode yang memberikan evaluasi terhadap kelayakan subjek tes dalam bentuk nilai.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2018-01-06</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v2i25</dc:identifier>
	<dc:identifier>10.15575/join.v2i2.110</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 2 No. 2 (2017); 92-101</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 2 No 2 (2017); 92-101</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v2i2</dc:source>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v2i25/74</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/113</identifier>
				<datestamp>2025-08-17T09:44:20Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Implementasi Kriptografi Algoritma Rivest Shamir Adleman dengan Playfair Cipher pada Pesan Teks Berbasis Android</dc:title>
	<dc:creator>Kurniawan, Satria Tri Cahya</dc:creator>
	<dc:creator>Dedih, Dedih</dc:creator>
	<dc:creator>Supriyadi, Supriyadi</dc:creator>
	<dc:subject xml:lang="en-US">Kriptografi</dc:subject>
	<dc:subject xml:lang="en-US">Enkripsi</dc:subject>
	<dc:subject xml:lang="en-US">Rivest Shamir Adlemen (RSA)</dc:subject>
	<dc:subject xml:lang="en-US">Playfair Chiper</dc:subject>
	<dc:description xml:lang="en-US">AbstrakKriptografi merupakan suatu teknik Â menyembunyian pesan dimana pesan tersebut hanya dapat diketahui oleh orang tertentu dimana pesan itu sering disebut dengan enkripsi.saat ini enkripsi sudah banyak dikembangkan salah satunya adalah metode Rivest Shamir Adleman (RSA) yang menggunakan dua kunci yaitu kunci publik dan kunci pribadi, dimana kunci tersebut dapat diatur dimana semakin panjang bit pembentukan kunci maka semakin sukar untuk dipecahkan karena sulitnya memfaktorkan dua bilangan yang sangat besar dan itu dianggap aman meskipun tidak pernah dibuktikan amanÂ  tidaknya, maka dari itu dalam penelitian ini akan dibuat keamanan yang lebih baik lagi dengan memadukannya dengan metode playfair chiper dimana pada kunci publik yang diatur diubah terlebih dahulu atau di enkripsi dengan playfair chiper baru bisa dipecahkan kembali dengan algoritma Rivest Shamir AdlemanÂ (RSA).</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2018-01-06</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v2i26</dc:identifier>
	<dc:identifier>10.15575/join.v2i2.113</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 2 No. 2 (2017); 102-109</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 2 No 2 (2017); 102-109</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v2i2</dc:source>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v2i26/76</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/115</identifier>
				<datestamp>2025-08-17T09:44:20Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Designing Android Based Augmented Reality  Location-Based Service Application</dc:title>
	<dc:creator>Hardiansyah, Alim</dc:creator>
	<dc:subject xml:lang="en-US">Augmented Reality</dc:subject>
	<dc:subject xml:lang="en-US">Location-based Service</dc:subject>
	<dc:description xml:lang="en-US">Android is an operating system for Linux based smartphone. Android provides an open platform for the developers to create their own application. The most developed and used application now is location based application. This application gives personalization service for mobile device user and is customized to their location. Location based service also gives an opportunity for the developers to develop and increase the value of service. One of the technologies that could be combined with location based application is augmented reality. Augmented reality combines the virtual world with the real one. By the assistance of augmented reality, our surrounding environment could interact in digital form. Information of objects and environment surround us could be added to the augmented reality system and presented.Â Based on the background, the writers tried to implement those technologies on now rapidly developing android application as a final project to achieve bachelor degree in Department of Informatics Engineering, Faculty of Information Technology and Visual Communication, Al Kamal Science and Technology Institute. This application could be functioned to locate school by using location based service technology with the assistance of navigational applications such as waze and google maps, in form of live direction process through the smartphone</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2018-01-06</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v2i27</dc:identifier>
	<dc:identifier>10.15575/join.v2i2.115</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 2 No. 2 (2017); 110-115</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 2 No 2 (2017); 110-115</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v2i2</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v2i27/77</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/125</identifier>
				<datestamp>2025-08-17T09:44:20Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Aplikasi Kalender Kehamilan  (Smart Pregnancy) Berbasis Android</dc:title>
	<dc:creator>Carudin, Carudin</dc:creator>
	<dc:creator>Apriningrum, Nelly</dc:creator>
	<dc:subject xml:lang="id-ID">Kehamilan</dc:subject>
	<dc:subject xml:lang="id-ID">HPL</dc:subject>
	<dc:subject xml:lang="id-ID">Kalendar Kehamilan</dc:subject>
	<dc:subject xml:lang="id-ID">Android</dc:subject>
	<dc:description xml:lang="id-ID">Penghitungan usia kehamilan dapat dilakukan dengan berbagai cara. Namun hasil evaluasi kompetensi penghitungan usia kehamilan, taksiran persalinan di prodi kebidanan unsika pada tahun 2016 masih rendah yaitu baru mencapai 20%. Kelemahan kemampuan mahasiswa dalam mengidentifikasi usia kehamilan juga didapatkan berdasarkan laporan dari lahan praktik mahasiswa prodi Kebidanan Unsika. Melihat data dan laporan tersebut penulis melakukan penelitian dengan membuat aplikasi berisi kalender kahamilan pada smartphone OS Android. Aplikasi kalendar kehamilan tersebut dirancang untuk mempermudah tenaga kesehatan dan calon tenaga kesehatan pemberi pelayanan kehamilan dalam menghitung usia kehamilan, taksiran kehamilan, dan juga membantu ibu hamil untuk mengontrol kehamilannyaÂ </dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2018-01-06</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v2i28</dc:identifier>
	<dc:identifier>10.15575/join.v2i2.125</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 2 No. 2 (2017); 116-120</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 2 No 2 (2017); 116-120</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v2i2</dc:source>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v2i28/78</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/135</identifier>
				<datestamp>2023-07-24T09:24:25Z</datestamp>
				<setSpec>join:Front</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Cover Depan JOIN Vol. 1 No. 1</dc:title>
	<dc:creator>JOIN, Admin</dc:creator>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2016-07-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/135</dc:identifier>
	<dc:identifier>10.15575/join.v1i1.135</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 1 No. 1 (2016)</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 1 No 1 (2016)</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v1i1</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/135/64</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/136</identifier>
				<datestamp>2023-07-24T09:24:25Z</datestamp>
				<setSpec>join:Back</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Cover Belakang JOIN Vol. 1 No. 1</dc:title>
	<dc:creator>JOIN, Admin</dc:creator>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2016-07-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/136</dc:identifier>
	<dc:identifier>10.15575/join.v1i1.136</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 1 No. 1 (2016)</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 1 No 1 (2016)</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v1i1</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/136/65</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/137</identifier>
				<datestamp>2023-07-24T09:19:59Z</datestamp>
				<setSpec>join:Front</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Cover Depan JOIN Vol. 1 No. 2</dc:title>
	<dc:creator>JOIN, Admin</dc:creator>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2016-07-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/137</dc:identifier>
	<dc:identifier>10.15575/join.v1i2.137</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 1 No. 2 (2016)</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 1 No 2 (2016)</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v1i2</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/137/66</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/138</identifier>
				<datestamp>2023-07-24T09:19:59Z</datestamp>
				<setSpec>join:Back</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Cover Belakang JOIN Vol. 1 No. 2</dc:title>
	<dc:creator>JOIN, Admin</dc:creator>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2016-07-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/138</dc:identifier>
	<dc:identifier>10.15575/join.v1i2.138</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 1 No. 2 (2016)</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 1 No 2 (2016)</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v1i2</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/138/67</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/139</identifier>
				<datestamp>2025-08-17T09:44:20Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Pengembangan Media Pembelajaran Interaktif dengan Menggunakan Metode Multimedia Development Life Cycle</dc:title>
	<dc:creator>Mustika, Mustika</dc:creator>
	<dc:creator>Sugara, Eka Prasetya Adhy</dc:creator>
	<dc:creator>Pratiwi, Maissy</dc:creator>
	<dc:subject xml:lang="id-ID">blackbox testing</dc:subject>
	<dc:subject xml:lang="id-ID">media pembelajaran interaktif</dc:subject>
	<dc:subject xml:lang="id-ID">multimedia</dc:subject>
	<dc:description xml:lang="id-ID">Media Pembelajaran memiliki peranan yang sangat penting pada proses perkuliahan. Media Pembelajaran yang digunakan pada mata kuliah Manajemen Proyek IT sub materi Metodologi Manajemen Proyek pada Sekolah Tinggi Manajemen Informatika dan Komputer (STMIK) PalComTech Palembang masih menggunakan modul yang didapat dari worksheet, dosen menggunakan metode ceramah dalam menjelaskan materi metodologi manajemen proyek. Metode ceramah masih memiliki kelemahan sehingga diperlukan pengembangan media pembelajaran. Penelitian ini mengunakan metode Multimedia Development Life Cycle (MDLC) dengan enam tahapan yaitu: konsep (Concept), perancangan (Desain), pengumpulan bahan(Material Collecting), pembuatan (Assembly), pengujian(Testing), dan distribusi (Distribution). Tujuan penelitian yaitu membuat media pembelajaran interaktif mata kuliah manajemen proyek, sub materiÂ  metodologi Manajemen Proyek yang berisikan tentang tahapan inisiasi, perencanaan, pelaksanaan, pengawasan dan penutupan, serta dokumen-dokumen yang diperlukan dalam pembangunan proyek IT. Manfaat yang diharapkan adalah media pembelajaran ini dapat menjadi alat bantu dalam proses perkuliahan manajemen proyek yang ada di STMIK Palcomtech. Aplikasi sudah diuji melalui blackbox testing, dengan hasil pengujian semua indikator dinyatakan baik</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2018-01-06</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v2i29</dc:identifier>
	<dc:identifier>10.15575/join.v2i2.139</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 2 No. 2 (2017); 121-126</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 2 No 2 (2017); 121-126</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v2i2</dc:source>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v2i29/79</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/140</identifier>
				<datestamp>2025-08-17T09:41:08Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Pengembangan Laboratorium Virtual Fisika Osilasi</dc:title>
	<dc:creator>Rizal, Adhi</dc:creator>
	<dc:creator>Adam, Riza Ibnu</dc:creator>
	<dc:creator>Susilawati, Susilawati</dc:creator>
	<dc:subject xml:lang="id-ID">EJSs</dc:subject>
	<dc:subject xml:lang="id-ID">Oscillation</dc:subject>
	<dc:subject xml:lang="id-ID">Technology Acceptance Model</dc:subject>
	<dc:subject xml:lang="id-ID">Virtual lab</dc:subject>
	<dc:description xml:lang="id-ID">This research aims to develop a virtual lab application with oscillation concept. Oscillation concept in this application is described as pendulum motion. The application was developed by using the ADDIE model and Easy Java Simulations (EJSs) software. It has advantages compared with similar applications, which has a damping coefficient that similar with real world condition. Some other features of the application are the users can run and pause the simulation, observe the details of changes in pendulum movement angle by using step forward button, users can change pendulum mass, adjust the length of the rope, gravitational force, initial angle, damping coefficient, and can observe the change of pendulum angular position in parabolic graphs in real-time. The application was tested using the Technology Acceptance Model (TAM) concept. Based on the research results, the user satisfaction level is categorized as very useful. Therefore, it can be conclude that the application can be accepted and used well by the user.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2018-06-30</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v3i19</dc:identifier>
	<dc:identifier>10.15575/join.v3i1.140</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 3 No. 1 (2018); 55-60</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 3 No 1 (2018); 55-60</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v3i1</dc:source>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v3i19/85</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2018 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/141</identifier>
				<datestamp>2025-08-17T09:41:08Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Analisa Sentimen Menggunakan Data Twitter, Flume, Hive Pada Hadoop dan Java Untuk Deteksi Kemacetan di Jakarta</dc:title>
	<dc:creator>Buslim, Nurhayati</dc:creator>
	<dc:creator>Busman, Busman</dc:creator>
	<dc:creator>Sinatrya, Nadika Sigit</dc:creator>
	<dc:creator>Kania, Tifani Shallynda</dc:creator>
	<dc:subject xml:lang="id-ID">Sentiment Analysis</dc:subject>
	<dc:subject xml:lang="id-ID">Big Data</dc:subject>
	<dc:subject xml:lang="id-ID">Twitter Data</dc:subject>
	<dc:subject xml:lang="id-ID">Congestion Detection</dc:subject>
	<dc:description xml:lang="id-ID">Berikut adalah paragraf yang sudah dirapikan:
Traffic congestion in big cities in Indonesia is unavoidable, especially in Jakarta. The increasing number of vehicles and the lack of public transportation are the main causes of traffic congestion in Jakarta. It disturbs people&#039;s activities. The government has already made various efforts to resolve the congestion problem; however, it requires high installation and maintenance costs and takes time to be implemented. People often complain about traffic congestion in Jakarta by posting on Twitter, which are called tweets. Every tweet posted is saved in the Twitter API and used for sentiment analysis. It analyzes the emotions of the users. Based on these problems, we conducted research on how to detect traffic congestion in Jakarta. Therefore, we tried to create a Congestion Detection App. We designed the app using UML diagrams. The Congestion Detection App is connected with Hadoop, Flume, Hive, and Derby. The app streams Twitter data collected by connecting with the Twitter API. This app is a Java-based application that can create and view data tables. It performs searches on tweets by ID and analyzes traffic conditions in specific regions in Jakarta. The app performs sentiment analysis on certain tweets and displays the results based on the data tables. The result of the research compares data from the Congestion Detection App with data from Google Maps. We made three value categories consisting of three colors: green for less traffic congestion with a value of 1, orange for medium-scale traffic congestion with a value of 2, and red for heavy traffic congestion with a value of 3. Based on these three categories and values, we used four regions as samples and compared the values with those from Google Maps data to determine accuracy. We achieved an 81% average accuracy from the four samples. The data from the tweet samples compared with Google Maps data showed significant congestion detection with the Congestion Detection App.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2018-06-30</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:format>application/msword</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v3i11</dc:identifier>
	<dc:identifier>10.15575/join.v3i1.141</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 3 No. 1 (2018); 1-9</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 3 No 1 (2018); 1-9</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v3i1</dc:source>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v3i11/86</dc:relation>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v3i11/251</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2018 Jurnal Online Informatika</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/144</identifier>
				<datestamp>2025-08-17T09:44:20Z</datestamp>
				<setSpec>join:Front</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Cover Depan JOIN Vol. 2 No. 2</dc:title>
	<dc:creator>JOIN, Admin</dc:creator>
	<dc:description xml:lang="en-US">-</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2018-01-06</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/144</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 2 No. 2 (2017)</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 2 No 2 (2017)</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v2i2</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/144/83</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/145</identifier>
				<datestamp>2025-08-17T09:44:20Z</datestamp>
				<setSpec>join:Back</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Cover Belakang JOIN Vol. 2 No. 2</dc:title>
	<dc:creator>JOIN, Admin</dc:creator>
	<dc:description xml:lang="en-US">-</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2018-01-06</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/145</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 2 No. 2 (2017)</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 2 No 2 (2017)</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v2i2</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/145/84</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/158</identifier>
				<datestamp>2025-08-17T09:41:08Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Technology Acceptance in Augmented Reality</dc:title>
	<dc:creator>Yuniarto, Dwi</dc:creator>
	<dc:creator>Helmiawan, Muhammad Agreindra</dc:creator>
	<dc:creator>Firmansyah, Esa</dc:creator>
	<dc:subject xml:lang="id-ID">AR</dc:subject>
	<dc:subject xml:lang="id-ID">TAM</dc:subject>
	<dc:subject xml:lang="id-ID">Questionnaire</dc:subject>
	<dc:subject xml:lang="id-ID">Data Analysis</dc:subject>
	<dc:description xml:lang="id-ID">Augmented Reality is now used in many fields, including in terms of helping the learning process. The purpose of this research is to know the effect of interrelated based on Technology Acceptance model, namely Perceived Usefulness, Perceived Easy to Use, Behavioral Intention Use, and Actual System Use on the use of Augmented Reality based card game. This research resulted that hypothesis in this research accepted after going through data analysis process from questionnaire result. A huge interest in the use of Augmented Reality-based games as actual technology as a factor in whether or not the game is accepted. Users, viewed in terms of ease of use and the benefits posed by the game is also very influential on the acceptance of games based on Augmented Reality.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2018-06-30</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:format>application/msword</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v3i12</dc:identifier>
	<dc:identifier>10.15575/join.v3i1.158</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 3 No. 1 (2018); 10-13</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 3 No 1 (2018); 10-13</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v3i1</dc:source>
	<dc:language>eng</dc:language>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v3i12/87</dc:relation>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v3i12/252</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2018 Jurnal Online Informatika</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/169</identifier>
				<datestamp>2025-08-17T09:41:08Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Implementasi  Wireless Sensor Network Untuk Otomatisasi Suhu Ruang Dan Kelembaban Tanah Pada Greenhouse Berbasis Web Server</dc:title>
	<dc:creator>Adnantha, Yogha Arieka</dc:creator>
	<dc:creator>Kusuma, Wahyu Andhyka</dc:creator>
	<dc:subject xml:lang="id-ID">WSN</dc:subject>
	<dc:subject xml:lang="id-ID">ESP8266</dc:subject>
	<dc:subject xml:lang="id-ID">DHT11</dc:subject>
	<dc:subject xml:lang="id-ID">Soil muisturation</dc:subject>
	<dc:subject xml:lang="id-ID">Automatication</dc:subject>
	<dc:subject xml:lang="id-ID">Greenhouse</dc:subject>
	<dc:description xml:lang="id-ID">Along with the increasing population of Indonesia which is also followed by the increasing rate of urbanization in the industrial sector, certainly affects the reduced agricultural sector to increase food needs. Greenhouse can be one solution to solve this problem, by utilize greenhouse our enviroment can be controlled and also protect the plants from outside interference. During this condition is still done manually both to measure the temperature or watering the plants. In this study the author developed a system to monitor and automate room temperature and soil moisture in greenhouse by utilizing Wireless Sensor Network (WSN) technology. The system consists of 1 node temperature and humidity chamber and 1 node of greenhouse soil moisture where each node is composed of arduino uno as its microcontroller, ESP8266 as Wi-Fi module, sensor, and relay. The results of monitoring and automation data will be sent to the web server by wireless, to make it easier for greenhouse farmers and monitoring their greenhouse. The results of this study can be found that the system is able to monitor and perform automatic control of temperature decrease, when the temperature reaches more than 28C and able to increase soil moisture automatically when the soil moisture is less than 40%, in addition by using ESP8266 data monitoring and automation results can be sent to the web server but based on the test results obtained that the maximum range of data transmission is 50 meters from the node to the access point.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2018-06-30</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v3i13</dc:identifier>
	<dc:identifier>10.15575/join.v3i1.169</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 3 No. 1 (2018); 14-21</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 3 No 1 (2018); 14-21</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v3i1</dc:source>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v3i13/88</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2018 Jurnal Online Informatika</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/171</identifier>
				<datestamp>2025-08-17T09:41:08Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">C4.5 Algorithm Application for Prediction of Self Candidate New Students in Higher Education</dc:title>
	<dc:creator>Darmawan, Erlan</dc:creator>
	<dc:subject xml:lang="id-ID">C4.5 Algorithm</dc:subject>
	<dc:subject xml:lang="id-ID">Retirement New Student Candidate</dc:subject>
	<dc:subject xml:lang="id-ID">Prediction</dc:subject>
	<dc:subject xml:lang="id-ID">Waterfall</dc:subject>
	<dc:description xml:lang="en-US">Data mining has a background with the condition of an abundance of data (the overload data) and the explosion of information faced by companies, institutions, or organizations that have been stored for many years. This situation is also faced in several universities that store various kinds of data, especially new admissions databases. However, the abundant data has not been widely used in digging the information or knowledge that can help university management in making strategic plans. Every year there are new students who retire and do not register, therefore, it takes an application that can process a lot of data to find out the possible retirement for new students. To find out the prediction of retirement prospective students, this paper uses C.45 algorithm. The method can change the very large fact into a decision tree that represents the rule. The result of this research is the application can classify the new students in a tree structure in order that it can produce a rule. This application is able to predict the possibility of the retirement of the new student. With this application, it is expected that the possibility of a prospective student retiring from college can be known at an early stage, so the management can make a decision easily. Development of this application uses PHP as the interface application system and MySql in-database processing. The system development methodology uses the waterfall model</dc:description>
	<dc:description xml:lang="id-ID">Data mining has background with the condition of an abundance of data (the overload data) and the explosion information faced by companies, institutions or organizations that are stored for many years. This situation is also faced in several universities that stores various kinds of data, especially new admissions database. But the abundant data has not been widely used in digging the information or knowledge that can help university management in making strategic plans. Every year there are new students who retire that do not register,therefore, it takes an application that can process a lot of data to find out the possible retirement for new students. To find out the prediction retirement prospective students, this paper uses C.45 algorithm. The method can change the a very large fact into a decision tree that represents the rule. The result of this research is that the application can classify the new students in tree structure in order that it can produce a rule. This application is able to predict the possibility of the retirement of new student. With this application, itÂ  is expected that the possibility of a prospective student will retire from college can be known at an early stage, so the management can make a decision easily. Development of this application built uses PHP as the interface application system and MySql in database processing. System development methodology used is the waterfall model</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2018-06-30</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v3i14</dc:identifier>
	<dc:identifier>10.15575/join.v3i1.171</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 3 No. 1 (2018); 22-28</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 3 No 1 (2018); 22-28</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v3i1</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v3i14/89</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2018 Jurnal Online Informatika</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/179</identifier>
				<datestamp>2025-08-17T09:41:08Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Implementasi Komputasi Paralel untuk Optimalisasi Komputasi Pada Aplikasi Transliterasi Huruf Latin ke Aksara Jawa</dc:title>
	<dc:creator>Syauqi, Ala</dc:creator>
	<dc:creator>Hidayah, Anis Nurul</dc:creator>
	<dc:subject xml:lang="id-ID">Javanese script</dc:subject>
	<dc:subject xml:lang="id-ID">Parallel computing</dc:subject>
	<dc:subject xml:lang="id-ID">Transliteration</dc:subject>
	<dc:subject xml:lang="id-ID">Multithread</dc:subject>
	<dc:description xml:lang="id-ID">Javanese script is one of the ancestral heritage of Indonesia that must be preserved. Nowadays javanese script is increasingly abandoned, since latin writing is often used in daily activities. This is become worse by student difficulties of learning to read and write javanese script because the methods are less attractive for example teacher centered learning. One of solution to solve this problem is interactive latin to javanese script transliteration application. Research on the latin to javanese script transliteration has been produced various applications such as JawaTex, Hanacaraka, and Pandawa. From these three applications is showed that the Pandawa application with decision tree method has the highest level of accuracy. However, the computational time required by this application method is also highest than other applications. The more transliterated text is conduct the longer process time is used. This research aims to shorten Pandawa application computing time with parallel computing method without modifies decesion tree algorithm. Parallel computing is implemented with multithread on java programming language to perform the process of latin into javanese script transliteration simultaneously. Experimental results obtained that the implementation of multithread in decicion tree method for latin into javanese script transliteration reduce the average computation time up to 97.05%.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2018-06-30</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v3i15</dc:identifier>
	<dc:identifier>10.15575/join.v3i1.179</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 3 No. 1 (2018); 29-35</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 3 No 1 (2018); 29-35</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v3i1</dc:source>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v3i15/90</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2018 Jurnal Online Informatika</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/180</identifier>
				<datestamp>2025-08-17T09:41:08Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Reducing Free Riding Behaviour in Collaborative Work with Computer Supported Tools</dc:title>
	<dc:creator>Kloppenburg, Wieger</dc:creator>
	<dc:creator>Nurlatifah, Eva</dc:creator>
	<dc:creator>Spijkerboer, Christian</dc:creator>
	<dc:creator>Yasmin, Fitri Almira</dc:creator>
	<dc:subject xml:lang="en-US">collaborative work</dc:subject>
	<dc:subject xml:lang="en-US">computer supported tools</dc:subject>
	<dc:subject xml:lang="en-US">free ride</dc:subject>
	<dc:subject xml:lang="en-US">social loafing</dc:subject>
	<dc:subject xml:lang="en-US">computer supported collaborative work</dc:subject>
	<dc:description xml:lang="en-US">Free riding behaviour is a problem that has been around for many years. With all the new technological advances, there is much more collaborative work supported by online tools. These developments make it easier for individuals to become a free rider. This research carried out a literature study, to find the best method to reduce free-riding behaviour. Besides the methods, this study also elaborates some factors that trigger free riders in a group. The methods which are highlighted in this research are the implementation of assessments, group awareness tools, sufficient group size and enhancing team morale. However, the study found that none of the methods cover all the aspects of free-riding behaviour. It is suggested by this research to combine and improve various methods, to a new method that can effectively reduce free-riding behaviour in collaborative work with computer-supported tools.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2018-06-30</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v3i16</dc:identifier>
	<dc:identifier>10.15575/join.v3i1.180</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 3 No. 1 (2018); 36-43</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 3 No 1 (2018); 36-43</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v3i1</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v3i16/91</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2018 Jurnal Online Informatika</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/196</identifier>
				<datestamp>2025-08-17T09:40:55Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Detect Malware in Portable Document Format Files (PDF) Using Support Vector Machine and Random Decision Forest</dc:title>
	<dc:creator>Charim, Abdachul</dc:creator>
	<dc:creator>Basuki, Setio</dc:creator>
	<dc:creator>Akbi, Denar Regata</dc:creator>
	<dc:subject xml:lang="id-ID">portable document format</dc:subject>
	<dc:subject xml:lang="id-ID">malware</dc:subject>
	<dc:subject xml:lang="id-ID">classification</dc:subject>
	<dc:subject xml:lang="id-ID">support vector machine</dc:subject>
	<dc:subject xml:lang="id-ID">random forest</dc:subject>
	<dc:description xml:lang="id-ID">Portable Document Format is a very powerful type of file to spread malware because it is needed by many people, this makes PDF malware not to be taken lightly. PDF files that have been embedded with malware can be Javascript, URL access, media that has been infected with malware, etc. With a variety of preventive measures can help to spread, for example in this study using the classification method between dangerous files or not. Two classification methods that have the highest accuracy value based on previous research are Support Vector Machine and Random Forest. There are 500 datasets consisting of 2 classes, namely malicious and not malicius and 21 malicius PDF features as material for the classification process. Based on the calculation of Confusion Matrix as a comparison of the results of the classification of the two methods, the results show that the Random Forest method has better results than Support Vector Machine even though its value is still not perfect.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2019-02-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:format>application/vnd.ms-excel</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v3i26</dc:identifier>
	<dc:identifier>10.15575/join.v3i2.196</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 3 No. 2 (2018); 99-102</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 3 No 2 (2018); 99-102</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v3i2</dc:source>
	<dc:language>eng</dc:language>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v3i26/97</dc:relation>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v3i26/253</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2018 Jurnal Online Informatika</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/205</identifier>
				<datestamp>2025-08-17T09:40:55Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Analysis of Backpropagation Algorithm in Predicting the Most Number of Internet Users in the World</dc:title>
	<dc:creator>Setti, Sunil</dc:creator>
	<dc:creator>Wanto, Anjar</dc:creator>
	<dc:subject xml:lang="id-ID">Analysis</dc:subject>
	<dc:subject xml:lang="id-ID">Backpropagation</dc:subject>
	<dc:subject xml:lang="id-ID">Prediction</dc:subject>
	<dc:subject xml:lang="id-ID">Internet</dc:subject>
	<dc:subject xml:lang="id-ID">World</dc:subject>
	<dc:description xml:lang="id-ID">The Internet today has become a primary need for its users. According to market research company e-Marketer, there are 25 countries with the largest internet users in the world. Indonesia is in the sixth position with a total of 112.6 million internet users. With the increasing number of internet users are expected to help improve the economy and also education in a country. To be able to increase the number of internet users, especially in Indonesia, it is necessary to predict for the coming years so that the government can provide adequate facilities and pre-facilities in order to balance the growth of internet users and as a precautionary step when there is a decrease in the number of internet users. The data used in this study focus on data on the number of internet users in 25 countries in 2013-2017. The algorithm used is Artificial Neural Network Backpropagation. Data analysis was processed by Artificial Neural Network using Matlab R2011b (7.13). This study uses 5 architectural models. The best network architecture generated is 3-50-1 with an accuracy of 92% and the Mean Squared Error (MSE) is 0.00151674.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2019-02-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v3i28</dc:identifier>
	<dc:identifier>10.15575/join.v3i2.205</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 3 No. 2 (2018); 110-115</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 3 No 2 (2018); 110-115</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v3i2</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v3i28/105</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2018 Jurnal Online Informatika</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/207</identifier>
				<datestamp>2025-08-17T09:41:08Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Security Analysis on the Decentralized Energy Trading System Using Blockchain Technology</dc:title>
	<dc:creator>Rahmadika, Sandi</dc:creator>
	<dc:creator>Ramdania, Diena Rauda</dc:creator>
	<dc:creator>Harika, Maisevli</dc:creator>
	<dc:subject xml:lang="en-US">Blockchain</dc:subject>
	<dc:subject xml:lang="en-US">energy trading</dc:subject>
	<dc:subject xml:lang="en-US">microgrid</dc:subject>
	<dc:subject xml:lang="en-US">peer-to-peer network</dc:subject>
	<dc:description xml:lang="en-US">Blockchain turns both currencies and commodities into a digital form without relying on middleman which allows one person to trade with another include trading the renewable energy. Blockchain technology as a secure and low-cost platform to track the billions of eventual transactions in a distributed energy economy has attracted the attention of experts in various fields of science. The current form of centralized energy trading system is still suffering from security concerns, quality of service, and to name a few. A decentralized energy system using blockchain technology allows the parties to create a trading energy transaction via microgrid. The blockchain technology offers the promise of an immutable, single source of truth from multiple sources without a third-party involvement. In this paper, we describe, explore and analyze the prominent implementation of blockchain technology in the energy sector. Furthermore, we analyze the security issues and highlight the performance of several attacks that might be occurred in the proposed system.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2018-06-30</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v3i17</dc:identifier>
	<dc:identifier>10.15575/join.v3i1.207</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 3 No. 1 (2018); 44-47</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 3 No 1 (2018); 44-47</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v3i1</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v3i17/92</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2018 Jurnal Online Informatika</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/213</identifier>
				<datestamp>2025-08-17T09:41:08Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Agile Data Architecture in Mining Industry for Continuously Business-IT Alignment: EA Perspective</dc:title>
	<dc:creator>Yuliana, Rika</dc:creator>
	<dc:creator>Rahardjo, Budi</dc:creator>
	<dc:subject xml:lang="en-US">data architecture</dc:subject>
	<dc:subject xml:lang="en-US">reference model</dc:subject>
	<dc:subject xml:lang="en-US">agile</dc:subject>
	<dc:subject xml:lang="en-US">enterprise architecture</dc:subject>
	<dc:subject xml:lang="en-US">alignment</dc:subject>
	<dc:description xml:lang="en-US">Data plays a vital role particularly in mining enterprises to foster innovation and business performance through precise decision-making. Scientists have created many kinds of database technology to support them, such as big data, data cloud, etc. Meanwhile business is always facing a fluctuant situation in using those various database technologies. Unfortunately, there is still hard to use database technology in a proper way because there are no model rules in making a perfect planning so that they can choose suitable tools for its own case. Therefore, this paper aims to design an agile enterprise data architecture model rules (blueprint) in mining company based on various frameworks, tools and methods/techniques so that managers can govern their data asset for sustainably business-IT alignment. This data architecture reference models can be easily adopted by CIOs in order to move toward an integrated mining enterprises as well as guide user in producing a precise decision-making.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2018-06-30</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v3i18</dc:identifier>
	<dc:identifier>10.15575/join.v3i1.213</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 3 No. 1 (2018); 48-54</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 3 No 1 (2018); 48-54</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v3i1</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v3i18/93</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2018 Jurnal Online Informatika</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/218</identifier>
				<datestamp>2025-08-17T09:41:08Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Implementasi Algoritma Cheapest Insertion Heuristic (CIH) dalam Penyelesaian Travelling Salesman Problem (TSP)</dc:title>
	<dc:creator>Utomo, Rio Guntur</dc:creator>
	<dc:creator>Maylawati, Dian Sa’adillah</dc:creator>
	<dc:creator>Alam, Cecep Nurul</dc:creator>
	<dc:subject xml:lang="id-ID">Traveling Salesman Problem (TSP)</dc:subject>
	<dc:subject xml:lang="id-ID">Cheapest Insertion Heuristic (CIH)</dc:subject>
	<dc:subject xml:lang="id-ID">Demand</dc:subject>
	<dc:description xml:lang="id-ID">Traveling salesman problem (TSP) is the problem of a salesman to visit the city of each city connected to each other and there is the weight of travel between the cities so as to form a complete weighted graph. Departing from a certain initial city, a salesman had to visit (n-1) another city exactly once and return on the initial city of departure. The purpose of TSP is to find the route of all cities with minimum total weight.Many algorithms have been found to solve the TSP, one of which is the Cheapest Insertion Heuristic (CIH) algorithm in the process of inserting weighted steps obtained from the equation c (i, k, j) = d (i, k) + d (k, j) - d (i, j). This algorithm provides different travel routes depending on the order of insertion of cities on the subtour in question.In this final project, the writer took the problem of distribution route of mineral water of al-ma&#039;some 240 ml cup type, with vehicle capacity to meet 1200 carton and have different customer / agent demand that is the distance of depot and agent far from each other, distribution costs.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2018-06-30</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v3i110</dc:identifier>
	<dc:identifier>10.15575/join.v3i1.218</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 3 No. 1 (2018); 61-67</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 3 No 1 (2018); 61-67</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v3i1</dc:source>
	<dc:language>ind</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v3i110/94</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2018 Jurnal Online Informatika</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/219</identifier>
				<datestamp>2025-08-17T09:41:08Z</datestamp>
				<setSpec>join:Front</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Cover Depan JOIN Vol. 3 No. 1</dc:title>
	<dc:creator>JOIN, Admin</dc:creator>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2018-06-30</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/219</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 3 No. 1 (2018)</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 3 No 1 (2018)</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v3i1</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/219/95</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2018 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/220</identifier>
				<datestamp>2025-08-17T09:41:08Z</datestamp>
				<setSpec>join:Back</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Cover Belakang JOIN Vol. 3 No. 1</dc:title>
	<dc:creator>JOIN, Admin</dc:creator>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2018-06-30</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/220</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 3 No. 1 (2018)</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 3 No 1 (2018)</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v3i1</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/220/96</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2018 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/226</identifier>
				<datestamp>2025-08-17T09:40:55Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Data Center Risks Analysis Through The COBIT Framework 4.1</dc:title>
	<dc:creator>Arini, Arini</dc:creator>
	<dc:creator>Wardhani, Luh Kesuma</dc:creator>
	<dc:creator>Matin, Iik Muhammad Malik</dc:creator>
	<dc:subject xml:lang="id-ID">COBIT 4.1</dc:subject>
	<dc:subject xml:lang="id-ID">data center</dc:subject>
	<dc:subject xml:lang="id-ID">risk</dc:subject>
	<dc:subject xml:lang="id-ID">IT Governance</dc:subject>
	<dc:description xml:lang="id-ID">Information Technology Governance in UIN Jakarta is the responsibility of the Pusat Teknologi Informasi dan Pangkalan Data (Pustipanda). Some troubles have occurred in the data center Pustipanda, among others the loss of courses and its values that have been inputted in the application of Academic Information System (AIS), loss of data that has been inputted on the application Beban Kinerja Dosen (BKD), damage data content on the portal in the environment UIN Jakarta. Risk analysis is needed to identify and anticipate and minimize risks which may occur. In this research, the risk analysis is using the COBIT 4.1 framework that is in the PO9 process (Manage and Assess IT Risk) as input towards PO9 is the domain of PO1, PO10, DS2, DS4, DS5, ME1, and ME4. Questionnaires which were distributed to respondents were developed from input variables. Respondents were chosen by purposive sampling method. The results of the questionnaire were recapitulated and calculated the value and degree of capability. The result of this research is the level of domain capability in data center Pustipanda is at level 2 (managed) with value 1.91. A fairly low value is obtained on DS4, DS5 and ME1 domains, which are 1.67, 1.88 and 0.67. Arosen risks from the majority of data center risk assessment were the absence of documented policies and procedure and lack of training for risk management measures at Pustipanda data center.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2019-02-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v3i21</dc:identifier>
	<dc:identifier>10.15575/join.v3i2.226</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 3 No. 2 (2018); 68-73</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 3 No 2 (2018); 68-73</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v3i2</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v3i21/100</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2018 Jurnal Online Informatika</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/227</identifier>
				<datestamp>2025-08-17T09:40:55Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">The Design of Population Data Application Using Unified Modeling Language</dc:title>
	<dc:creator>Hardiansyah, Alim</dc:creator>
	<dc:creator>Laday, Ravie Kurnia</dc:creator>
	<dc:creator>Suhaeli, Muhammad</dc:creator>
	<dc:subject xml:lang="id-ID">Population data application</dc:subject>
	<dc:subject xml:lang="id-ID">Unified Modeling Language</dc:subject>
	<dc:description xml:lang="id-ID">Population data collection at the sub-district level still uses a manual system. It is causing less efficient time. In this study the application of population data is generated in the sub-district, using web applications and using the Unified Modeling Language design. With the above considerations, we need a system that can solve population data problems. With this application, it is expected that it will facilitate the processing of population data. This new application can accelerate the process of population registration with the help of human resources who can run it. Advice needed human resources that can run the application properly.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2019-02-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v3i22</dc:identifier>
	<dc:identifier>10.15575/join.v3i2.227</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 3 No. 2 (2018); 74-79</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 3 No 2 (2018); 74-79</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v3i2</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v3i22/99</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2018 Jurnal Online Informatika</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/230</identifier>
				<datestamp>2025-08-17T09:40:55Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Decision Support System  for Determining Thesis Supervisor using A Weighted Product (WP) Method</dc:title>
	<dc:creator>Arifin, Suci Ramadhani</dc:creator>
	<dc:creator>Mintamanis, Josua Crishan</dc:creator>
	<dc:subject xml:lang="id-ID">Thesis Supervisor</dc:subject>
	<dc:subject xml:lang="id-ID">Decision Support System</dc:subject>
	<dc:subject xml:lang="id-ID">Weighted Product Method</dc:subject>
	<dc:description xml:lang="id-ID">English Department of Tadulako University is a department with the highest number of lecturers in Tadulako University. Thesis supervisor determination at the English Department of Tadulako University still use the conventional way so that the determination of the thesis supervisor is done in a long time. In addition, some lecturers have more workload than other lecturers. Decision support system for the determination of the thesis supervisor in the English Department of Tadulako University was built to overcome this problem using the Weighted Product method. The system is a desktop-based application using the Visual Studio programming language and MySQL DBMS for database processing. The application of a decision support system for determining thesis supervisors can help make the selection of supervisors accurately and quickly with a mathematical calculation system.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2019-02-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v3i23</dc:identifier>
	<dc:identifier>10.15575/join.v3i2.230</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 3 No. 2 (2018); 80-85</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 3 No 2 (2018); 80-85</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v3i2</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v3i23/101</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2018 Jurnal Online Informatika</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/238</identifier>
				<datestamp>2025-08-17T09:43:39Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Utilization of E-KTP as Home Safety Using Arduino Nano Based on Android</dc:title>
	<dc:creator>Mustolih, Riyanto</dc:creator>
	<dc:creator>Lenggana, U Tresna</dc:creator>
	<dc:creator>Mulyana, Jajang</dc:creator>
	<dc:subject xml:lang="id-ID">E-KTP</dc:subject>
	<dc:subject xml:lang="id-ID">door</dc:subject>
	<dc:subject xml:lang="id-ID">home</dc:subject>
	<dc:subject xml:lang="id-ID">home security</dc:subject>
	<dc:subject xml:lang="id-ID">RFID.</dc:subject>
	<dc:description xml:lang="id-ID">Security is an absolute necessity for every homeowner so that he can create a sense of security and calm when the house is left to travel by the owner of the house. Poor security makes the house a target for theft. Home security currently used still uses conventional methods. E-KTP (Electronic Identity Card) provided by the government to every citizen has a technology in which there is an RFID chip that can be used as a substitute for conventional door locks. In order for the e-KTP to be able to access the home door, an application needs to be made that can be used on android smartphone. The application makes it easy for homeowners in the E-KTP registration process that can be used to open the door. In addition, the application can send notifications to homeowners if the house is entered by thieves via SMS (Short Message Service) and Call / Call through the SIM800L module which is controlled using an Arduino Nano Microcontroller.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2019-09-06</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/238</dc:identifier>
	<dc:identifier>10.15575/join.v4i1.238</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 4 No. 1 (2019); 9-15</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 4 No 1 (2019); 9-15</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v4i1</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/238/110</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2019 Jurnal Online Informatika</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/239</identifier>
				<datestamp>2025-08-17T09:40:55Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">The Implementation of QR-Code Technology on Bulak Fish Center Information System</dc:title>
	<dc:creator>Liantoni, Febri</dc:creator>
	<dc:creator>Rosetya, Septiyawan</dc:creator>
	<dc:creator>Rahmawati, Weny M.</dc:creator>
	<dc:subject xml:lang="id-ID">QR-Code</dc:subject>
	<dc:subject xml:lang="id-ID">Site</dc:subject>
	<dc:subject xml:lang="id-ID">Technology</dc:subject>
	<dc:description xml:lang="id-ID">The technology that is currently developing is the use of QR-Code. QR-Code can convey information quickly with the acquisition of fast responses as well. QR-Code can be used on smartphones. Some media and companies widely use the QR-Code in Indonesia. QR-Code is not only used as an application identity but is also used as a means of effective, simple and modern business promotion. Making information systems for Sentra Ikan Bulak Surabaya is done by using QR-Code technology as a means of product promotion in the sales process. Research that has been done can run well and can support and be useful in improving the means of promotion. Traders find it easier to collect data on existing systems. Buyers can access the site and see reviews from other buyers so buyers will feel interested in buying the product.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2019-02-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v3i210</dc:identifier>
	<dc:identifier>10.15575/join.v3i2.239</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 3 No. 2 (2018); 123-127</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 3 No 2 (2018); 123-127</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v3i2</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v3i210/106</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2018 Jurnal Online Informatika</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/252</identifier>
				<datestamp>2025-08-17T09:40:55Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Data Logging Implementation on Web-Based Communication on Arduino Devices</dc:title>
	<dc:creator>Tsani, Yasyfi Rahmanda</dc:creator>
	<dc:creator>Subardono, Alif</dc:creator>
	<dc:subject xml:lang="id-ID">Internet of Things</dc:subject>
	<dc:subject xml:lang="id-ID">Data logging</dc:subject>
	<dc:subject xml:lang="id-ID">Arduino</dc:subject>
	<dc:subject xml:lang="id-ID">Website</dc:subject>
	<dc:description xml:lang="id-ID">Arduino is one of the microcontroller devices commonly used on the Internet of Things. This research designed and objectified web-based data logging system that aimed to record communication and sensir data in iot devices, so it could monitor log data in iot. Devices from this data logging system was created using arduino uno r3 with adding ethernet shield modul and temperature sensor DHT 11. in iot devices, there is an important parameter, that is date time as a history in data logging sistem using an actual time. Website was functioned as system for showing data from log data and could be monitored realtime. This system could record communication brtween arduino device and NTP server using internet network. Beside that?this system could record important parameters in the system such as IP source address, ip destination address, ip address in each node, device time, and room temperature information. Parameters that had been recorded would be stored to database, then would be showed in web data logging.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2019-02-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v3i27</dc:identifier>
	<dc:identifier>10.15575/join.v3i2.252</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 3 No. 2 (2018); 103-109</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 3 No 2 (2018); 103-109</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v3i2</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v3i27/98</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2018 Jurnal Online Informatika</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/255</identifier>
				<datestamp>2025-08-17T09:40:55Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Android Battle Game Based on Augmented Reality with  2D Object Marker</dc:title>
	<dc:creator>Azim, Muhammad Fauzan</dc:creator>
	<dc:creator>Hidayat, Eka Wahyu</dc:creator>
	<dc:creator>Rachman, Andi Nur</dc:creator>
	<dc:subject xml:lang="id-ID">Augmented Reality</dc:subject>
	<dc:subject xml:lang="id-ID">Game</dc:subject>
	<dc:subject xml:lang="id-ID">Marker Based Tracking Multimedia</dc:subject>
	<dc:description xml:lang="id-ID">This research develops the game by applying the Augmented Reality (AR) system in making games. Similar games that have been observed have a weakness where the Augmented Reality characters that appear do not match the marker, there is no calculation of the distance between the marker card as a battle trigger, and no character has raised the urband legend. For this reason, it is necessary to make a similar game by applying the Based Tracking Marker technique by calculating the distance of action between two markers by raising the theme of urband legend Indonesia and foreign legend legend. This research succeeded in making Multimedia battle fighting game products using the Multimedia Development Life Cycle (MDLC) method approach - Luther. Based on the tests that have been carried out, the alpha test results are functionally appropriate and from the beta testing the results of the User Acceptence Test (UAT) functionalities obtained a value of 71% declared feasible to use with the interpretation of &quot;Good&quot; which means this game is feasible and can be developed.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2019-01-31</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v3i29</dc:identifier>
	<dc:identifier>10.15575/join.v3i2.255</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 3 No. 2 (2018); 116-122</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 3 No 2 (2018); 116-122</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v3i2</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v3i29/104</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2018 Jurnal Online Informatika</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/256</identifier>
				<datestamp>2025-08-17T09:43:39Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Assessment of Readiness and Usability of Information Systems Use</dc:title>
	<dc:creator>Yuniarto, Dwi</dc:creator>
	<dc:creator>Subiyakto, Aang</dc:creator>
	<dc:creator>Abd. Rohman, Aedah Binti</dc:creator>
	<dc:creator>Marliana, Reny Rian</dc:creator>
	<dc:subject xml:lang="en-US">assessment</dc:subject>
	<dc:subject xml:lang="en-US">readiness</dc:subject>
	<dc:subject xml:lang="en-US">usability</dc:subject>
	<dc:subject xml:lang="en-US">use of information systems</dc:subject>
	<dc:description xml:lang="en-US">The assessment of the use of information systems has been carried out by many researchers. This research was conducted in Private Universities in Indonesia, which currently involve many information systems in many ways, especially those related to the management of Higher Education, by measuring the readiness and usability of the use of information systems with models that I build from the integration of two models. The results of the measurement of this study were obtained from the distribution of questionnaires, there were 47% of respondents who filled 61-80% of the level of IS usage and 68% of respondents stated their readiness in the level of readiness to use IS. The stage consists of evaluating reflective measurement models and structural model assessments. Evaluating reflective measurement in evaluating internal consistency reliability using Composite Reliability, Reliability Indicator, Convergent Validity, and Discriminant Validity, finally concluded that the use of the Readiness and Usability integration model can be forwarded to a more complex research stage and can use the questionnaire.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2019-09-06</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/256</dc:identifier>
	<dc:identifier>10.15575/join.v4i1.256</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 4 No. 1 (2019); 1-8</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 4 No 1 (2019); 1-8</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v4i1</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/256/113</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2019 JOIN (Jurnal Online Informatika)</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/258</identifier>
				<datestamp>2025-08-17T09:40:55Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">E-Learning Model to Support Industrial Based Adaptive Learning for Student Vocational High School</dc:title>
	<dc:creator>Andrian, Rian</dc:creator>
	<dc:creator>Fauzi, Ahmad</dc:creator>
	<dc:subject xml:lang="en-US">e-learning</dc:subject>
	<dc:subject xml:lang="en-US">adaptive learning</dc:subject>
	<dc:subject xml:lang="en-US">Vocational High Schools</dc:subject>
	<dc:subject xml:lang="en-US">PURWASUKASI</dc:subject>
	<dc:description xml:lang="en-US">Vocational High Schools have an important role in improving the quality of human resources to meet industrial needs. However, the current education system in Vocational Schools especially in Purwakarta, Subang, Karawang, Bekasi (PURWASUKASI) still has disadvantages compared to other countries. The government through the ministry of industry has started vocational education for Vocational Schools in Indonesia. Vocational education conducted to support the creation of qualified human resources that can meet the industrial needs related to labor. The implementation of information technology in the field of education is one of the ways to improve the quality of education, including education in vocational schools. E-learning implementation aims to improve the quality of education. E-learning is often used in the application of adaptive learning in the field of education. In this study, an e-learning system model has been created that has been developed to support industrial based adaptive learning for Vocational High Schools in PURWASUKASI. The system that has been developed has been tested from the functional side of the system and shows that the developed e-learning system is ready to use.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2019-02-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v3i24</dc:identifier>
	<dc:identifier>10.15575/join.v3i2.258</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 3 No. 2 (2018); 86-92</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 3 No 2 (2018); 86-92</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v3i2</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v3i24/102</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2019 JOIN(Jurnal Online Informatika)</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/264</identifier>
				<datestamp>2025-08-17T09:43:39Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Short Message Service Encoding Using the Rivest-Shamir-Adleman Algorithm</dc:title>
	<dc:creator>Prasetyo, Deny</dc:creator>
	<dc:creator>Widianto, Eko Didik</dc:creator>
	<dc:creator>Indasari, Ike Pratiwi</dc:creator>
	<dc:subject xml:lang="id-ID">Android</dc:subject>
	<dc:subject xml:lang="id-ID">Cryptography</dc:subject>
	<dc:subject xml:lang="id-ID">Rivest-Shamir-Adleman</dc:subject>
	<dc:subject xml:lang="id-ID">Short Message Service</dc:subject>
	<dc:description xml:lang="id-ID">SMS (Short Message Service) is one of the data exchange features in cellphones, including Android smartphones, which are the most widely used smartphone platforms today. However, the security of the SMS is questionable because the message sent must pass through a third party frist, namely SMSC (Short Message Service Center), so that message can be tapped or misused. One of the ways to reduce this risk is to encrypt or keep the original message secret by applying the cryptography algorithm. This research is to develop a system that serves to encrypt and decrypt SMS for Android-based smartphone users. The application is created to encrypt dan decrypt SMS using the Java programming language on Android, that is applied to smartphone integrated with Android Studio and used RSA cryptography algorithm. The application can be used to encrypt and decrypt SMS using the RSA algorithm on the Android-based smartphone. This application can send an SMS with a size of 86 characters and using QR Code to exchange the public key.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2019-09-06</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/264</dc:identifier>
	<dc:identifier>10.15575/join.v4i1.264</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 4 No. 1 (2019); 39-45</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 4 No 1 (2019); 39-45</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v4i1</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/264/116</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2019 Jurnal Online Informatika</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/266</identifier>
				<datestamp>2025-08-17T09:40:55Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">The process capability model for governance of the Election Organizer Ethics Court system</dc:title>
	<dc:creator>Putra, Syopiansyah Jaya</dc:creator>
	<dc:subject xml:lang="en-US">governance</dc:subject>
	<dc:subject xml:lang="en-US">maturity</dc:subject>
	<dc:subject xml:lang="en-US">capability</dc:subject>
	<dc:subject xml:lang="en-US">ethics</dc:subject>
	<dc:description xml:lang="en-US">The capability level assesment for governance of the Election Organizer Ethics Court Information System [SIPEPP] is necessary to ensure strategic planning allignment, value delivery, risk management, resources management and performance measurement. SIPEPP implementation has special problems in optimizing human resources and weak supervision management, so it is important to asess capability levels to provide solutions to these problems. The purpose of this paper is to assess the current and expected capability level conditions, gap analysis and recommendations for SIPEPP good governance. This research method uses the Process Assessment Model (PAM) from Control Objectives for Information and Related Technology (COBIT 5) which consists of stages of initiation, planning the assessment, briefing, data collection, data validation, process attribute level, and result and recommendation. The results of this study indicate the level of optimization of resources and performance monitoring processes are level 2 (Managed Process) which means that the process has been recorded, measured and in accordance with the objectives. The process of managing human resources, assets and operations are at level 1 (Performed Process), meaning that both processes have been applied to SIPEPP governance. Recommendations related human resources are the selection of appropriate human resources by involving management, while related assets require a priority list of implementation systems, and related supervision requires detailed monitoring schedules. This study result can be taken into consideration for improving good governance of SIPEPP implementation.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2019-02-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/v3i25</dc:identifier>
	<dc:identifier>10.15575/join.v3i2.266</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 3 No. 2 (2018); 93-98</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 3 No 2 (2018); 93-98</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v3i2</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/v3i25/103</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2018 JOIN (Jurnal Online Informatika)</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/267</identifier>
				<datestamp>2025-08-17T09:43:39Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Finding Nearest Mosque Using Haversine Formula on Android Platform</dc:title>
	<dc:creator>Setyorini, Indah</dc:creator>
	<dc:creator>Ramayanti, Desi</dc:creator>
	<dc:subject xml:lang="id-ID">Mosque</dc:subject>
	<dc:subject xml:lang="id-ID">Haversine Formula</dc:subject>
	<dc:subject xml:lang="id-ID">Google Maps</dc:subject>
	<dc:description xml:lang="en-US">
Prayer is the second pillar of Islam, emphasized after the two sentences of syahadat. It&#039;s regarded as perfect worship. Obligatory for both Mukimin and Musafir, its virtue in the mosque equals 20 degrees of reward compared to elsewhere. However, amidst increasing traffic jams, travelers often face difficulty finding the nearest mosque for Maghrib prayer. This problem can be addressed by finding the shortest path from the starting point to the destination. To tackle this issue, a research was conducted to design an application providing directions to the nearest mosque in the Larangan area of Tangerang city. The system utilizes the haversine formula and Java programming language for implementation. Java builds the application, MySQL database stores data, and Google Maps API determines the route.
</dc:description>
	<dc:description xml:lang="id-ID">Prayer is the second pillar of Islam and it is emphasized after the two sentences of syahadat. It has been said that itâ€™s as perfect and as good as worship. Prayer is one of the obligations for Muslims and must be done both for Mukimin and Musafir. The virtue of prayer in the mosque is the same as the value of 20 degrees of reward compared to prayer elsewhere. With the traffic jam phenomenon that is increasing due to heavy traffic. For someone who is traveling home in the afternoon before maghrib, some people are always confused to do Maghrib prayer because of the lack of information about the nearest mosque. The problem can be solved by finding the shortest path is a problem to find the minimum route from the starting point to the destination point with the shortest route. This research was made to design an application that provides direction to the nearest mosque in the area of Larangan, Tangerang city. In the making of this system to find the shortest path can be solved using the haversine formula and using the java programming language, where java is used to build applications while the database used is the MySQL database and the use of Google Maps API in determining the route.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2019-09-06</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/267</dc:identifier>
	<dc:identifier>10.15575/join.v4i1.267</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 4 No. 1 (2019); 57-62</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 4 No 1 (2019); 57-62</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v4i1</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/267/132</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2019 Jurnal Online Informatika</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/290</identifier>
				<datestamp>2025-08-17T09:40:55Z</datestamp>
				<setSpec>join:Front</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Front Cover JOIN Vol. 3 No. 2</dc:title>
	<dc:creator>JOIN, Admin</dc:creator>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2019-02-08</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/290</dc:identifier>
	<dc:identifier>10.15575/join.v3i2.290</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 3 No. 2 (2018)</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 3 No 2 (2018)</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v3i2</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/290/107</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2019 JOIN (Jurnal Online Informatika)</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/291</identifier>
				<datestamp>2025-08-17T09:40:55Z</datestamp>
				<setSpec>join:Back</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Back Cover JOIN Vol. 3 No. 2</dc:title>
	<dc:creator>JOIN, Admin</dc:creator>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2019-02-08</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format></dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/291</dc:identifier>
	<dc:identifier>10.15575/join.v3i2.291</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 3 No. 2 (2018)</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 3 No 2 (2018)</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v3i2</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/291/108</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2019 JOIN (Jurnal Online Informatika)</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/292</identifier>
				<datestamp>2025-08-17T09:43:39Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Development of National Digital Evidence Metadata</dc:title>
	<dc:creator>Sugiantoro, Bambang</dc:creator>
	<dc:subject xml:lang="id-ID">The industrial era 4.0</dc:subject>
	<dc:subject xml:lang="id-ID">Metadata and digital evidence</dc:subject>
	<dc:description xml:lang="id-ID">The industrial era 4.0 has caused tremendous disruption in many sectors of life. The rapid development of information and communication technology has made the global industrial world undergo a revolution. The act of cyber-crime in Indonesia that utilizes computer equipment, mobile phones are increasingly increasing. The information in a file whose contents are explained about files is called metadata. The evidence items for cyber cases are divided into two types, namely physical evidence, and digital evidence. Physical evidence and digital evidence have different characteristics, the concept will very likely cause problems when applied to digital evidence. The management of national digital evidence that is associated with continued metadata is mostly carried out by researchers. Considering the importance of national digital evidence management solutions in the cyber-crime investigation process the research focused on identifying and modeling correlations with the digital image metadata security approach. Correlation analysis reads metadata characteristics, namely document files, sounds and digital evidence correlation analysis using standard file maker parameters, size, file type and time combined with digital image metadata. nationally designed the highest level of security is needed. Security-enhancing solutions can be encrypted against digital image metadata (EXIF). Read EXIF Metadata in the original digital image based on the EXIF 2.3 Standard ID Tag, then encrypt and insert it into the last line. The description process will return EXIF decryption results in the header image. This can secure EXIF Metadata information without changing the image quality</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2019-09-06</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/292</dc:identifier>
	<dc:identifier>10.15575/join.v4i1.292</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 4 No. 1 (2019); 24-27</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 4 No 1 (2019); 24-27</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v4i1</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/292/118</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2019 Jurnal Online Informatika</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/293</identifier>
				<datestamp>2025-08-17T09:43:39Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Application of the Finite State Machine Algorithm on 2D Platformer Rabbit Games vs Zombies</dc:title>
	<dc:creator>Solihin, Ade</dc:creator>
	<dc:creator>Hidayat, Eka Wahyu</dc:creator>
	<dc:creator>Aldya, Aldy Putra</dc:creator>
	<dc:subject xml:lang="id-ID">Android</dc:subject>
	<dc:subject xml:lang="id-ID">Artificial Intelligence</dc:subject>
	<dc:subject xml:lang="id-ID">FSM</dc:subject>
	<dc:subject xml:lang="id-ID">Game</dc:subject>
	<dc:subject xml:lang="id-ID">Side Scrolling</dc:subject>
	<dc:description xml:lang="id-ID">This research develops Android games by applying the FSM Algorithm (Finite State Machine) for the movement of NPC (Non-Player Character) to produce dynamic movements. The popular and legendary game with the appearance of side scroller is Super Mario Bross and Shovel Knight, the game is the most preferred game of its time to the present, but the game does not apply AI (Artificial Intelligence) so the game seems less challenging. The game is a concept game that is currently rarely used. Based on this, a side scroller-based survival game was created by implementing AI on NPCs on the Android platform. The AI used is the FSM Algorithm which functions to regulate enemy movements. The method used in developing multimedia products of this game uses MDLC (Multimedia Development Life Cycle). Based on the tests that have been carried out, the alpha test results are functionally appropriate and the results of beta testing using UserAcceptence Test (UAT) obtained a value of 86.40% which is declared feasible to use and can be developed. The advantages of this game are the presence of shock elements in the form of landslides, bursts of water, rock rain, and attacks by eagles</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2019-09-06</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/293</dc:identifier>
	<dc:identifier>10.15575/join.v4i1.293</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 4 No. 1 (2019); 33-38</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 4 No 1 (2019); 33-38</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v4i1</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/293/109</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2019 Jurnal Online Informatika</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/296</identifier>
				<datestamp>2025-08-17T09:43:39Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">Implementation of Finding Shortest Route for Pharmacy Location Using A-star Algorithm</dc:title>
	<dc:creator>Juniawan, Fransiskus Panca</dc:creator>
	<dc:creator>Sylfania, Dwi Yuny</dc:creator>
	<dc:creator>Agrina, Dini</dc:creator>
	<dc:subject xml:lang="id-ID">A-star Algorithm</dc:subject>
	<dc:subject xml:lang="id-ID">Geographical Information System</dc:subject>
	<dc:subject xml:lang="id-ID">Shortest Path</dc:subject>
	<dc:subject xml:lang="id-ID">Pharmacy</dc:subject>
	<dc:description xml:lang="id-ID">The number of pharmacies in the Pangkalpinang City has increased rapidly. This is directly proportional to the needs of the people of Pangkalpinang City to fulfill the health needs, buy medicine or divert doctor&#039;s prescriptions. This is a debate for people who do not know the location of pharmacies in this city. Practically, people can just go to a pharmacy with a location that far from user location, even though there is a pharmacy near the user. This is because there is no pharmacy information location in the Pangkalpinang City. To solve this problem, proposed a system that can display the location of all pharmacies in the Pangkalpinang City. In addition, the system can search the shortest path from the user&#039;s location to the nearest pharmacy location around using the A * algorithm. This algorithm was chosen because its advantages that are able to produce optimal solutions according to the expected heuristic functions. The results of the testing are that the system can optimize and be able to search the shortest path from the user&#039;s location to the nearest pharmacy.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2019-09-06</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/296</dc:identifier>
	<dc:identifier>10.15575/join.v4i1.296</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 4 No. 1 (2019); 46-52</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 4 No 1 (2019); 46-52</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v4i1</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/296/125</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2019 Fransiskus Panca Juniawan, Dwi Yuny Sylfania, Dini Agrina when this is published</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/298</identifier>
				<datestamp>2025-08-17T09:43:39Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id-ID">An Analysis of Spam Email Detection Performance Assessment Using Machine Learning</dc:title>
	<dc:creator>Santoso, Budi</dc:creator>
	<dc:subject xml:lang="id-ID">spam detection</dc:subject>
	<dc:subject xml:lang="id-ID">e-mail</dc:subject>
	<dc:subject xml:lang="id-ID">machine learning</dc:subject>
	<dc:subject xml:lang="id-ID">performance</dc:subject>
	<dc:description xml:lang="id-ID">Spam email is very annoying for email account users to get relevant information. Detection of email spam has actually been applied to email services for the public with various methods. But for the use of a limited number of company&#039;s e-mail accounts, not all e-mail servers provide spam e-mail detection features. The server administrator must add a separate or modular spam detection feature so that e-mail accounts can be protected from spam e-mail. This study aims to get the best method in the process of detecting spam emails. Some machine learning methods such as Logistic Regression, Decision Tree, and Random Forest are applied and compared results to get the most efficient method of detecting spam e-mail. Efficiency measurements are obtained from the speed of training and testing processes, as well as the accuracy in detecting spam emails. The results obtained in this study indicate that the Random Forest method has the best performance with a test data speed of 0.19 seconds and an accuracy of 98%. This result can be used as a reference for the development of spam detection using other methods.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2019-09-06</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/298</dc:identifier>
	<dc:identifier>10.15575/join.v4i1.298</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 4 No. 1 (2019); 53-56</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 4 No 1 (2019); 53-56</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v4i1</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/298/119</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2019 Jurnal Online Informatika</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/304</identifier>
				<datestamp>2025-08-17T09:43:39Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Implementation SHA512 Hash Function And Boyer-Moore String Matching Algorithm For Jpeg/exif Message Digest Compilation</dc:title>
	<dc:creator>Fitriyanto, Rachmad</dc:creator>
	<dc:creator>Yudhana, Anton</dc:creator>
	<dc:creator>Sunardi, Sunardi</dc:creator>
	<dc:subject xml:lang="en-US">Message digest</dc:subject>
	<dc:subject xml:lang="en-US">JPEG/exif</dc:subject>
	<dc:subject xml:lang="en-US">SHA512</dc:subject>
	<dc:subject xml:lang="en-US">Hash value</dc:subject>
	<dc:subject xml:lang="en-US">Boyer-Moore</dc:subject>
	<dc:description xml:lang="en-US">
Security information method for JPEG/exif documents generally aims to prevent security attacks by protecting
documents with password and watermark. Both methods cannot be used to determine the condition of data integrity at the detection stage of the information security cycle. Message Digest is the essence of a file that has a function as a digital fingerprint to represent data integrity. This study aims to compile digital fingerprints to detect changes that occurred in JPEG / exif documents in information security. The research phase consists of five stages. The first stage, identification of the JPEG / exif document structure conducted using the Boyer-Moore string matching algorithm to find JPEG/exif segments location. The Second stage is segment content acquisition, conducted based on segment location and length obtained. The Third step, computing message digest for each segment using SHA512 hash function. Fourth stage, JPEG / exif document modification experiments to identified affected segments. The fifth stage is selecting and combining the hash value of the segment into the message digest. The obtained result shows the message digest for JPEG/exif documents composed of three hash values. The SOI segment hash value used to detect modifications for JPEG to png conversion and image editing. The APP1 hash value used to detect metadata editing. The SOF0 hash values use to detect modification for image recoloring, cropping and resizing — the combination from three hash values as JPEG/exif’s message digest.
</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2019-09-06</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/304</dc:identifier>
	<dc:identifier>10.15575/join.v4i1.304</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 4 No. 1 (2019); 16-23</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 4 No 1 (2019); 16-23</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v4i1</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/304/117</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2019 Jurnal Online Informatika</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/307</identifier>
				<datestamp>2025-08-17T09:43:39Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">The Advantages from Cloud Computing Application Towards Small Micro Medium Enterprise</dc:title>
	<dc:title xml:lang="id-ID">The Advantages from Cloud Computing Application Towards SMME (UMKM)</dc:title>
	<dc:creator>Az-zahra, Tazkia Shabrina</dc:creator>
	<dc:subject xml:lang="id-ID">Cloud-computing</dc:subject>
	<dc:subject xml:lang="id-ID">SMME</dc:subject>
	<dc:subject xml:lang="id-ID">IT</dc:subject>
	<dc:description xml:lang="en-US">
Small Micro Medium Enterprises (SMME) is one of the business enterprises that has a prime role in the development of economic growth in Indonesia. The SMME also not only reduces the number of jobless but also improve the community’s standard of living. Nonetheless, in this globalization era where the technology reaches its peak in every field, some SMME entrepreneurs have not taken advantage of IT-based business yet. On the other hand, the utilization of IT in the business field has many profitable benefits. This could make the SMME faced trouble and hard to survive in the tight competition with other bigger enterprises that had applied IT in the future. The main reason that SMME entrepreneur has not applied the IT system is that they lack fund. Moreover, cloud computing is a technology that can be used for every SMME entrepreneur without any costs. The advantages of this system utilization are to improve competitiveness, increase its flexibility, reduce costs, and to improve both agility and scalability. This research is based on a literature study that describes research’s aim that is to seek advantages from cloud computing implementation towards SMME in Indonesia so they can compete with international enterprises with a bigger scale. The researcher expects that SMME entrepreneurs in Indonesia can utilize Information technology particularly cloud computing, to support their business.
</dc:description>
	<dc:description xml:lang="id-ID">Small Micro Medium Enterprises (SMME) is one of the business enterprises that has a prime role in the development of economic growth in Indonesia. The SMME also not only reduces the number of jobless but also improve the communityâ€™s standard of living. Nonetheless, in this globalization era where the technology reaches its peak in every field, some SMME entrepreneurs have not taken advantage of IT-based business yet. On the other hand, the utilization of IT in the business field has many profitable benefits. This could make the SMME faced trouble and hard to survive in the tight competition with other bigger enterprises that had applied IT in the future. The main reason that SMME entrepreneur has not applied the IT system is that they lack fund. Moreover, cloud computing is a technology that can be used for every SMME entrepreneur without any costs. The advantages of this system utilization are to improve competitiveness, increase its flexibility, reduce costs, and to improve both agility and scalability. This research is based on a literature study that describes researchâ€™s aim that is to seek advantages from cloud computing implementation towards SMME in Indonesia so they can compete with international enterprises with a bigger scale. The researcher expects that SMME entrepreneurs in Indonesia can utilize Information technology particularly cloud computing, to support their business.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2019-09-06</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/307</dc:identifier>
	<dc:identifier>10.15575/join.v4i1.307</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 4 No. 1 (2019); 28-32</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 4 No 1 (2019); 28-32</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v4i1</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/307/114</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2019 Jurnal Online Informatika</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/314</identifier>
				<datestamp>2025-08-17T09:43:26Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Implementation of Image Enhancement Algorithm for Image Forensics using Mathlab</dc:title>
	<dc:creator>Suteja, Fauzan Novaldi</dc:creator>
	<dc:creator>Hidayat, Eka Wahyu</dc:creator>
	<dc:creator>Widiyasono, Nur</dc:creator>
	<dc:subject xml:lang="en-US">Image Enhancement Algorithms</dc:subject>
	<dc:subject xml:lang="en-US">Image Forensics</dc:subject>
	<dc:subject xml:lang="en-US">MSE</dc:subject>
	<dc:subject xml:lang="en-US">PSNR</dc:subject>
	<dc:subject xml:lang="en-US">Timing-Run.</dc:subject>
	<dc:description xml:lang="en-US">The purpose of this journal is to explain the implementation of the image enhancement algorithm for image forensics. Image Forensic deals with the types of digital evidence in the form of digital image files. One of the most commonly used digital devices in providing digital evidence for forensic analysis is CCTV (Closed-Circuit Television). CCTV images have a low quality such as noise, blur, lack of light intensity, etc., so that the image must be enhanced so that forensic analysis can be done. To enhance image quality, an application is needed by applying the image enhancement algorithm. The algorithm applied to the application is a Low Pass Filter to increase low pixel intensity, High Pass Filter to increase high pixel intensity, Median Filter to replaces the original pixel value with the pixel center value of the image, Mean Filter to replaces the original pixel value with a value the average pixel of the image, the Gaussian Filter for reducing noise in the image, the Wiener Filter to reduce blur in the image, the Histogram Equalization spreads the image histogram value, Contrast Stretching to stretch the contrast intensity in the image and Bicubic Interpolation to increase the image size and resize the image. In this study, the application was built using MATLAB and the testing process for each algorithm was based on Timing-Run, MSE and PSNR parameters. From the test, the average MSE value is 1058.512083 and the PSNR value is 541.61875 dB, which means that the resulting image has a fairly high level of similarity and the average time needed to process the algorithm for the image is 0.114627915 seconds.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2020-02-14</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/314</dc:identifier>
	<dc:identifier>10.15575/join.v4i2.314</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 4 No. 2 (2019); 79-84</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 4 No 2 (2019); 79-84</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v4i2</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/314/137</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2020 Jurnal Online Informatika</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/330</identifier>
				<datestamp>2025-08-17T09:43:26Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Lossless Text Image Compression using Two Dimensional Run Length Encoding</dc:title>
	<dc:creator>Nuha, Hilal H</dc:creator>
	<dc:subject xml:lang="en-US">Lossless compression</dc:subject>
	<dc:subject xml:lang="en-US">Huffman Encoding</dc:subject>
	<dc:subject xml:lang="en-US">Run-length Encoding</dc:subject>
	<dc:subject xml:lang="en-US">Text Image</dc:subject>
	<dc:description xml:lang="en-US">Text images are used in many types of conventional data communication where texts are not directly represented by digital character such as ASCII but represented by an image, for instance facsimile file or scanned documents. We propose a combination of Run Length Encoding (RLE) and Huffman coding for two dimensional binary image compression namely 2DRLE. Firstly, each row in an image is read sequentially. Each consecutive recurring row is kept once and the number of occurrences is stored. Secondly, the same procedure is performed column-wise to the image produced by the first stage to obtain an image without consecutive recurring row and column. The image from the last stage is then compressed using Huffman coding. The experiment shows that the 2DRLE achieves a higher compression ratio than conventional Huffman coding for image by achieving more than 8:1 of compression ratio without any distortion.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2020-02-14</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/330</dc:identifier>
	<dc:identifier>10.15575/join.v4i2.330</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 4 No. 2 (2019); 75-78</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 4 No 2 (2019); 75-78</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v4i2</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/330/136</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2019 JOIN (Jurnal Online Informatika)</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/379</identifier>
				<datestamp>2025-08-17T09:43:26Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Diagnosis of Types of Diseases in Cassava Plant by Bayes Method</dc:title>
	<dc:creator>Sidik, Agung Purnomo</dc:creator>
	<dc:subject xml:lang="en-US">Expert System</dc:subject>
	<dc:subject xml:lang="en-US">Bayes Method</dc:subject>
	<dc:subject xml:lang="en-US">Cassava</dc:subject>
	<dc:description xml:lang="en-US">This research was conducted to implement the Bayes algorithm in an expert system to diagnose types of diseases in cassava plants. The research data was taken from the Binjai City Agriculture and Fisheries Office in 2018. The expert system was built based on the web, where the application was built using the PHP programming language and MySQL DBMS. The results showed that the Bayes algorithm can be used in expert system applications to diagnose types of cassava plant diseases. In the Bayes algorithm, the knowledge base is taken from the data of the amount of data from cassava plants that suffer from disease, so the results of diagnosing cassava plants are based on existing data. Therefore, the more patient data that is used as a knowledge base, the better the diagnosis results are given.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2020-02-14</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/379</dc:identifier>
	<dc:identifier>10.15575/join.v4i2.379</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 4 No. 2 (2019); 69-74</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 4 No 2 (2019); 69-74</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v4i2</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/379/135</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2019 JOIN (Jurnal Online Informatika)</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/382</identifier>
				<datestamp>2025-08-17T09:39:54Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Reactive Forwarding and Proactive Forwarding Performance Comparison on SDN-Based Network</dc:title>
	<dc:creator>Suranegara, Galura Muhammad</dc:creator>
	<dc:creator>Ichsan, Ichwan Nul</dc:creator>
	<dc:creator>Setyowati, Endah</dc:creator>
	<dc:subject xml:lang="en-US">Open network operating system</dc:subject>
	<dc:subject xml:lang="en-US">Proactive forwarding</dc:subject>
	<dc:subject xml:lang="en-US">Reactive forwarding</dc:subject>
	<dc:subject xml:lang="en-US">Software-defined networking</dc:subject>
	<dc:description xml:lang="en-US">Software-defined networking (SDN) technology is one key technology in telecommunications networks that are currently widely studied. In SDN-based networks, the controller holds the key to the reliability of a network because all control functions are held by the controller as one of the open-source controllers, the Open Network Operating System (ONOS) has two forwarding mechanisms, namely reactive forwarding, and proactive forwarding. This study compares performance between reactive forwarding and proactive forwarding on ONOS with VM migration as traffic. The parameter measured is the total migration time using simple network topology. From the test results, the proactive forwarding scenario can optimize the fastest potential of the topology tested by using the path that has the largest bandwidth available on the network topology. In comparison, reactive forwarding can only pass through the smallest hops of the tested topology. From the measurement results, the average migration time performance using a proactive forwarding scenario is 36.16% faster than the reactive forwarding scenario.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2020-07-16</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/382</dc:identifier>
	<dc:identifier>10.15575/join.v5i1.382</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 5 No. 1 (2020); 115-120</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 5 No 1 (2020); 115-120</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v5i1</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/382/156</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2020 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/394</identifier>
				<datestamp>2025-08-17T09:43:26Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Security Scanner For Web Applications Case Study: Learning Management System</dc:title>
	<dc:creator>Andrian, Rian</dc:creator>
	<dc:creator>Fauzi, Ahmad</dc:creator>
	<dc:subject xml:lang="en-US">Security</dc:subject>
	<dc:subject xml:lang="en-US">Web Application</dc:subject>
	<dc:subject xml:lang="en-US">Security Scanner</dc:subject>
	<dc:subject xml:lang="en-US">Learning Management System</dc:subject>
	<dc:description xml:lang="en-US">In software engineering, web applications are software that are accessed using a web browser through a network such as the Internet or intranet. Web applications are applications that can be relied on by users to do many useful activities. Despite the awareness of web application developers about safe programming practices, there are still many aspect in web applications that can be exploited by attacker. The development of web applications and the Internet causes the movement of information systems to use them as a basis. Security is needed to protect the contents of web applications that are sensitive and provide a safe process of sending data, therefore application security must be applied to all infrastructure that supports web applications, including the web application itself. Most organizations today have some kind of web application security program or try to build/ improve. But most of these programs do not get the results expected for the organization, are not durable or are not able to provide value continuously and efficiently and also cannot improve the mindset of developers to build/ design secure web applications. This research aims to develop a web application security scanner that can help overcome security problems in web applications.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2020-02-14</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/394</dc:identifier>
	<dc:identifier>10.15575/join.v4i2.394</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 4 No. 2 (2019); 63-68</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 4 No 2 (2019); 63-68</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v4i2</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/394/134</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2019 JOIN (Jurnal Online Informatika)</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/446</identifier>
				<datestamp>2025-08-17T09:43:26Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Load Balancing Network by using Round Robin Algorithm: A Systematic Literature Review</dc:title>
	<dc:creator>Hidayat, Taufik</dc:creator>
	<dc:creator>Azzery, Yasep</dc:creator>
	<dc:creator>Mahardiko, Rahutomo</dc:creator>
	<dc:subject xml:lang="en-US">Load Balance</dc:subject>
	<dc:subject xml:lang="en-US">Round Robin Algorithm</dc:subject>
	<dc:subject xml:lang="en-US">Security</dc:subject>
	<dc:subject xml:lang="en-US">Network</dc:subject>
	<dc:subject xml:lang="en-US">Systematic Literature Review</dc:subject>
	<dc:description xml:lang="en-US">The use of load balance on a network will be very much needed if the network is an active network and is widely accessed by users. A reason is that it allows network imbalances to occur. Round Robin (RR) algorithm can be applied for network load balancing because it is a simple algorithm to schedule processes so that it can provide work process efficiency. Authors use the Systematic Literature Review (SLR) method in which it can be applied for criteria selection during papers search to match the title being raised. SLR is divided into five stages, namely formalization of questions, criteria selection, selection of sources, selection of search results, and quality assessment. By using SLR, it is expected that papers according to criteria and quality can be found.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2020-02-14</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/446</dc:identifier>
	<dc:identifier>10.15575/join.v4i2.446</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 4 No. 2 (2019); 85-89</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 4 No 2 (2019); 85-89</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v4i2</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/446/138</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2019 JOIN (Jurnal Online Informatika)</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/487</identifier>
				<datestamp>2025-08-17T09:43:26Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">A Middleware Framework between Mobility and IoT Using IEEE 802.15.4e Sensor Networks</dc:title>
	<dc:creator>Alam, Tanweer</dc:creator>
	<dc:description xml:lang="en-US">In this paper, we propose a mobility framework for connecting the physical things in wireless ad hoc sensor networks. Our area of study is the internet of things by using an ad hoc sensor network. Our purpose in this study is to create a mobility framework for the internet of things. For example- how we connect many physical objects and give them a sense of sensing each other in an ad hoc environment. We can connect different physical objects in a framework of an ad hoc sensor network. Our main contribution is a new methodology for simulating mobility physical objects for the internet of things. Our methodology uses the correct and efficient simulation of the desired study and can be implemented in a framework of ad hoc sensor networks. Our study will generate a new framework for solving the issue of connectivity among physical objects. The proposed mobility framework is feasible to run among physical objects using the ad hoc sensor network.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2020-02-14</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/487</dc:identifier>
	<dc:identifier>10.15575/join.v4i2.487</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 4 No. 2 (2019); 90-94</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 4 No 2 (2019); 90-94</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v4i2</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/487/139</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2019 JOIN (Jurnal Online Informatika)</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header status="deleted">
				<identifier>oai:ojs.join.if.uinsgd.ac.id:article/499</identifier>
				<datestamp>2022-05-16T13:36:11Z</datestamp>
				<setSpec>join:ART</setSpec>
			</header>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/505</identifier>
				<datestamp>2025-08-17T09:39:54Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Analysis and Implementation Machine Learning for YouTube Data Classification by Comparing the Performance of Classification Algorithms</dc:title>
	<dc:creator>Amanda, Riyan</dc:creator>
	<dc:creator>Negara, Edi Surya</dc:creator>
	<dc:subject xml:lang="en-US">Data Mining</dc:subject>
	<dc:subject xml:lang="en-US">Experimental Method</dc:subject>
	<dc:subject xml:lang="en-US">Machine Learning</dc:subject>
	<dc:subject xml:lang="en-US">YouTube Data Classification</dc:subject>
	<dc:description xml:lang="en-US">Every day, people around the world upload 1.2 million videos to YouTube or more than 100 hours per minute, and this number is increasing. The condition of this continuous data will be useless if not utilized again. To dig up information on large-scale data, a technique called data mining can be a solution. One of the techniques in data mining is classification. For most YouTube users, when searching for video titles do not match the desired video category. Therefore, this research was conducted to classify YouTube data based on its search text. This article focuses on comparing three algorithms for the classification of YouTube data into the Kesenian and Sains category. Data collection in this study uses scraping techniques taken from the YouTube website in the form of links, titles, descriptions, and searches. The method used in this research is an experimental method by conducting data collection, data processing, proposed models, testing, and evaluating models. The models applied are Random Forest, SVM, Naive Bayes. The results showed that the accuracy rate of the random forest model was better by 0.004%, with the label encoder not being applied to the target class, and the label encoder had no effect on the accuracy of the classification models. The most appropriate model for YouTube data classification from data taken in this study is NaÃ¯ve Bayes, with an accuracy rate of 88% and an average precision of 90%.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2020-07-16</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/505</dc:identifier>
	<dc:identifier>10.15575/join.v5i1.505</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 5 No. 1 (2020); 61-72</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 5 No 1 (2020); 61-72</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v5i1</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/505/146</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2020 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/511</identifier>
				<datestamp>2025-08-17T09:39:38Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Customer Loyality Segmentation on Point of Sale System Using Recency-Frequency-Monetary (RFM) and K-Means</dc:title>
	<dc:creator>Rizki, Bayu</dc:creator>
	<dc:creator>Ginasta, Nava Gia</dc:creator>
	<dc:creator>Tamrin, Muh Akbar</dc:creator>
	<dc:creator>Rahman, Ali</dc:creator>
	<dc:subject xml:lang="en-US">Point of sale</dc:subject>
	<dc:subject xml:lang="en-US">RFM (Recency</dc:subject>
	<dc:subject xml:lang="en-US">Frequency</dc:subject>
	<dc:subject xml:lang="en-US">Monetary)</dc:subject>
	<dc:subject xml:lang="en-US">K-means</dc:subject>
	<dc:description xml:lang="en-US">It is no doubt that the development of the business world has been progressive. Point of sale is one of the many system used as a means of payment in various existing businesses, especially in heterogeneous markets. The activity of transactions between Point of Sale Systems and Customers occur in the business world. Keep in mind also that one of the main factors of business success, is from customers. There is the need of an attractive strategy and certainly it will be to increase the income and assets of a business. To know that, this research will explore the behavior of customer which is based marketing, through RFM Method (Recency, Frequency and Monetary). The case of this study is in Goldfinger Store. It will do segmentation and also use data mining technique to do clustering by using K-Means with result of loyal and potential customer. The results of segmentation using RFM (Recency, Frequency, Monetary) and K-Means methods have produced multiple clusters by dividing them into groups.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2020-12-02</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/511</dc:identifier>
	<dc:identifier>10.15575/join.v5i2.511</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 5 No 2 (2020); 130-136</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol. 5 No 2 (2020); 130-136</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v5i2</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/511/158</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2020 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/517</identifier>
				<datestamp>2025-08-17T09:39:08Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">The Implementation of RPG Concept on Breakout Games Using LibGDX Framework</dc:title>
	<dc:creator>Nodas, Andres</dc:creator>
	<dc:creator>Tjahjadi, Djajasukma</dc:creator>
	<dc:creator>Rahman, Ali</dc:creator>
	<dc:subject xml:lang="en-US">Arcade</dc:subject>
	<dc:subject xml:lang="en-US">Breakout</dc:subject>
	<dc:subject xml:lang="en-US">Implementation</dc:subject>
	<dc:subject xml:lang="en-US">LibGDX</dc:subject>
	<dc:subject xml:lang="en-US">Prototyping</dc:subject>
	<dc:subject xml:lang="en-US">Role Playing Game (RPG)</dc:subject>
	<dc:description xml:lang="en-US">As technology becomes more global, RPG games runs into a good development. One of which is a combination of RPG with another games. This journal aims to combine the breakout games and the RPG which has its characteristics. This game development uses prototyping method, in which analysing the necessity and determining the goals of the software. Then, prototype will be created and evaluated regularly so that the result can use 2D graphics. This game also can be used as a reference to reflexes practising. A modeling is conducted to design â€˜use case,â€™ scenario process, activity diagram, class diagram, and sequence diagram as well as to conduct an interface design. A calibration that is used, is calibrating the programme which is created as well as the features in the programme itself. It can be concluded that the construction of RPG games combination and breakout using eclipse and libgdx works well. In addition, it uses the components such as TMX tile map, sprite, sprite batching, box2d and input handling.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2021-12-26</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/517</dc:identifier>
	<dc:identifier>10.15575/join.v6i2.517</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 6 No. 2 (2021); 233-245</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 6 No 2 (2021); 233-245</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v6i2</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/517/210</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2021 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/532</identifier>
				<datestamp>2025-08-17T09:39:54Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Prediction of Indonesian Inflation Rate Using Regression Model Based on Genetic Algorithms</dc:title>
	<dc:creator>Dharma, Faisal</dc:creator>
	<dc:creator>Shabrina, Shabrina</dc:creator>
	<dc:creator>Noviana, Astrid</dc:creator>
	<dc:creator>Tahir, Muhammad</dc:creator>
	<dc:creator>Hendrastuty, Nirwana</dc:creator>
	<dc:creator>Wahyono, Wahyono</dc:creator>
	<dc:subject xml:lang="en-US">Genetic Algorithm</dc:subject>
	<dc:subject xml:lang="en-US">Inflation Level</dc:subject>
	<dc:subject xml:lang="en-US">Mean Squared Error</dc:subject>
	<dc:subject xml:lang="en-US">Prediction</dc:subject>
	<dc:subject xml:lang="en-US">Regression</dc:subject>
	<dc:description xml:lang="en-US">Inflation occurs where there is an increase in the price of goods or services in general and continuously in a country. Uncontrolled inflation will have an impact on the decline of the Indonesian economy. Therefore, the prediction of future inflation levels is necessary for the government to develop economic policies in the future. Prediction of inflation levels can be done by studying historical past Consumer Price Index (CPI) data. Regression methods are often used to solve prediction problems. The problem of finding the optimal prediction model can be seen as an optimization problem. Genetic algorithms are often used to deal with optimization problems. Thus, this work proposed to use a genetic algorithm-based regression model for predicting inflation levels. The model was trained and evaluated using real CPI data which obtained from the Indonesian Central Bank. Based on the experiment, it is proved that the proposed model is effective in predicting the inflation level as it gains MSE of 0.1099.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2020-07-16</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/532</dc:identifier>
	<dc:identifier>10.15575/join.v5i1.532</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 5 No. 1 (2020); 45-52</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 5 No 1 (2020); 45-52</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v5i1</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/532/142</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2020 Jurnal Online Informatika</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/537</identifier>
				<datestamp>2025-08-17T09:39:54Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Rupiah Exchange Prediction of US Dollar Using Linear, Polynomial, and Radial Basis Function Kernel in Support Vector Regression</dc:title>
	<dc:creator>Alida, Mufni</dc:creator>
	<dc:creator>Mustikasari, Metty</dc:creator>
	<dc:subject xml:lang="en-US">Linear</dc:subject>
	<dc:subject xml:lang="en-US">Polynomial</dc:subject>
	<dc:subject xml:lang="en-US">Radial Basis Function</dc:subject>
	<dc:subject xml:lang="en-US">Regression</dc:subject>
	<dc:subject xml:lang="en-US">Support Vector Regression</dc:subject>
	<dc:description xml:lang="en-US">As a developing country, Indonesia is affected by fluctuations in foreign exchange rates, especially the US Dollar. Determination of foreign exchange rates must be profitable so a country can run its economy well. The prediction of the exchange rate is done to find out the large exchange rates that occur in the future and the government can take the right policy. Prediction is done by one of the Machine Learning methods, namely the Support Vector Regression (SVR) algorithm. The prediction model is made using three kernels in SVR. Each kernel has the best model and, the accuracy and error values are compared. The Linear Kernel has C = 7, max_iter = 100. The Polynomial Kernel has gamma = 1, degree = 1, max_iter = 4000 and C = 700. The RBF kernel has gamma = 0.03, epsilon = 0.007, max_iter = 2000 and C = 100. Linear kernels have advantages in terms of processing time compared to Polynomial and Radial Basis Function (RBF) kernels with an average processing time of 0.18 seconds. Besides that, in terms of accuracy and error, the RBF kernel has advantages over the Linear and Polynomial kernels with the value R2 = 95.94% and RMSE = 1.25%.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2020-07-16</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/537</dc:identifier>
	<dc:identifier>10.15575/join.v5i1.537</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 5 No. 1 (2020); 53-60</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 5 No 1 (2020); 53-60</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v5i1</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/537/143</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2020 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/544</identifier>
				<datestamp>2025-08-17T09:39:22Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Interactive Learning Media for Cellular Communication Systems using the Multimedia Development Life Cycle Model</dc:title>
	<dc:creator>Putri, Hasanah</dc:creator>
	<dc:creator>Shadiq, Iqbal</dc:creator>
	<dc:creator>Putri, Gigin Gantini</dc:creator>
	<dc:subject xml:lang="en-US">Interactive learning media</dc:subject>
	<dc:subject xml:lang="en-US">Multimedia Development Life Cycle (MDLC)</dc:subject>
	<dc:subject xml:lang="en-US">Cellular communication systems</dc:subject>
	<dc:subject xml:lang="en-US">Adobe flash professional cs6</dc:subject>
	<dc:subject xml:lang="en-US">Action script 2.0</dc:subject>
	<dc:subject xml:lang="en-US">Functionality testing</dc:subject>
	<dc:subject xml:lang="en-US">Quantitative testing</dc:subject>
	<dc:description xml:lang="en-US">Based on the observations conducted to the students of Diploma of Telecommunications Engineering Telkom University. It revealed that the students have difficulty learning and understanding the chapters of call processing and network optimization in the course of cellular communication systems. It has resulted from the current learning media, which are only in the form of textbooks and Powerpoint slides considered less attractive. Hence, the learning process becomes ineffective and has an impact on low learning outcomes. In this study, an interactive learning media was designed with the Multimedia Development Life Cycle (MDLC) method, Adobe Flash professional CS6 software, using the action script 2.0 programming language. Learning media were designed according to usersâ€™ needs and learning outcomes of cellular communication system courses. Based on the testing results, the functionality showed 100% of features function as design specifications. Meanwhile, the user satisfaction testing results obtained an average MOS of 4.73, which means that the learning media is classified great. Furthermore, based on the quantitative testing, the average value of Quiz after using this interactive learning media was 81, which means that the learning media can increase studentsâ€™ interest so that it affects the increase in learning outcomes by 66% from previous years.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2021-06-17</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/544</dc:identifier>
	<dc:identifier>10.15575/join.v6i1.544</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 6 No. 1 (2021); 1-10</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 6 No 1 (2021); 1-10</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v6i1</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/544/174</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2021 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/546</identifier>
				<datestamp>2025-08-17T09:39:54Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Analyzing and Forecasting Admission data using Time Series Model</dc:title>
	<dc:creator>Muhamad, Nu&#039;man Normas</dc:creator>
	<dc:creator>Thamrin, Husni</dc:creator>
	<dc:subject xml:lang="en-US">Admission</dc:subject>
	<dc:subject xml:lang="en-US">ARIMA</dc:subject>
	<dc:subject xml:lang="en-US">Autoregression</dc:subject>
	<dc:subject xml:lang="en-US">Forecasting</dc:subject>
	<dc:subject xml:lang="en-US">Time Series</dc:subject>
	<dc:description xml:lang="en-US">Problems that will be faced by higher education institutions, especially in the phase of new student admissions. Careful planning and strategies are needed in dealing with the process of admission of new students. The data for planning can be obtained using the forecasting method. The time series forecasting model is used to get forecasting data. Forecasting data is used for the decision making process. The data of new student admissions obtained is 3-period data (2017 - 2019). The data obtained is stationary. Because the data is stationary, the data does not need differentiation. The data obtained also has a sufficient correlation value, and has a loop on the 7th lag. Before making an application, a test is performed to find a time series model that is suitable for admission data. The tested models are the ARIMA model and the Autoregression model. In testing the forecast timespan, the ARIMA model gets a smaller error value in almost all tests. In the Cross-validation method, the ARIMA Model also gets a smaller RMSECV or MAECV value than the AR model. The ARIMA model was chosen to be implemented into the application. The auto_arima algorithm is used so that applications can adapt to different data. The ARIMA model is implemented into a prediction application using the Python programming language. Application development uses Django as a web-based web application framework. Bootstrap is used to create application interfaces. the result from forecasted data is acceptable for short period.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2020-07-16</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/546</dc:identifier>
	<dc:identifier>10.15575/join.v5i1.546</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 5 No. 1 (2020); 35-44</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 5 No 1 (2020); 35-44</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v5i1</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/546/153</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2020 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/548</identifier>
				<datestamp>2025-08-17T09:39:54Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Exploiting Web Scraping for Education News Analysis Using Depth-First Search Algorithm</dc:title>
	<dc:creator>Arumi, Endah Ratna</dc:creator>
	<dc:creator>Sukmasetya, Pristi</dc:creator>
	<dc:subject xml:lang="en-US">Algorithm</dc:subject>
	<dc:subject xml:lang="en-US">Depth-first search</dc:subject>
	<dc:subject xml:lang="en-US">Education news</dc:subject>
	<dc:subject xml:lang="en-US">Online news</dc:subject>
	<dc:subject xml:lang="en-US">Web scraping</dc:subject>
	<dc:description xml:lang="en-US">Online news is one source of data that is always up to date and provides information or factual data. The search engine is one of the features for users to be able to enter keywords based on the expected category quickly. The development of education in Indonesia makes it essential to discuss, in this study using unstructured data in online news with the keyword Education included as a parameter, and adding search methods in the field of Artificial Intelligence so that the data becomes more accurate. Data that used here was from online news, namely CNN Indonesia, Detikcom, and Liputan6. Using Python Programming with depth-first search method (DFS), when compared with the results data for relevant news. Web erosion using DFS will be very helpful in searching because this method can check the date data was sent and then track the destination URL. Of the three online media sites, Detikcom produces the highest monthly data yielding an average of 885 news about education. At the same time, Liputan6 has the least amount of data on average, 28 news per month, but the data obtained are very relevant compared to Detikcom and CNN Indonesia.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2020-07-16</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/548</dc:identifier>
	<dc:identifier>10.15575/join.v5i1.548</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 5 No. 1 (2020); 19-26</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 5 No 1 (2020); 19-26</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v5i1</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/548/149</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2020 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/551</identifier>
				<datestamp>2025-08-17T09:39:38Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Long Short-Term Memory Approach for Predicting Air Temperature In Indonesia</dc:title>
	<dc:creator>Gunawan, Putu Harry</dc:creator>
	<dc:creator>Munandar, Devi</dc:creator>
	<dc:creator>Farabiba, Anis Zainia</dc:creator>
	<dc:subject xml:lang="en-US">Air temperature</dc:subject>
	<dc:subject xml:lang="en-US">Deep learning</dc:subject>
	<dc:subject xml:lang="en-US">Long short-term memory</dc:subject>
	<dc:subject xml:lang="en-US">Prediction</dc:subject>
	<dc:description xml:lang="en-US">Air temperature is one of the main factors for describing the weather behaviour in the earth. Since Indonesia is located on and near equator, then monitoring the air temperature is needed to determine either global climate change occurs or not. Climate change can have an impact on biological growth in various fields. For instance, climate change can affect the quality of production and growth of animal and plants. Therefore, air temperature prediction is important to meteorologists and Indonesian government to provide information in many sectors. Various prediction algorithms have been used to predict temperature and produce different accuracy. In this study, the deep learning method with Long Short-Term Memory (LSTM) model is used to predict air temperature. Here, the results show that LSTM model with one layer and Adaptive Moment Estimation (ADAM) optimizer produce accuracy which is 32% of , 0.068 of MAE and 0.99 of RMSE. Moreover, here, ADAM optimizer is found better than Stochastic Gradient Descent (SGD) optimizer.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2020-12-03</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/551</dc:identifier>
	<dc:identifier>10.15575/join.v5i2.551</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 5 No 2 (2020); 161-168</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol. 5 No 2 (2020); 161-168</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v5i2</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/551/162</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2020 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/558</identifier>
				<datestamp>2025-08-17T09:39:54Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Optimization of Sentiment Analysis for Indonesian Presidential Election using Naïve Bayes and Particle Swarm Optimization</dc:title>
	<dc:creator>Hayatin, Nur</dc:creator>
	<dc:creator>Marthasari, Gita Indah</dc:creator>
	<dc:creator>Nuarini, Lia</dc:creator>
	<dc:subject xml:lang="en-US">NaÃ¯ve Bayes</dc:subject>
	<dc:subject xml:lang="en-US">Opinion extraction</dc:subject>
	<dc:subject xml:lang="en-US">Sentiment analysis</dc:subject>
	<dc:subject xml:lang="en-US">Particle swarm optimization</dc:subject>
	<dc:description xml:lang="en-US">Twitter can be used to analyze sentiment to get public opinion about public figures to find a trend in positive or negative responses, especially to analyze sentiments related to presidential candidates in the 2019 election in Indonesia. Naïve Bayes (NB) can be used to classify tweet feed into polarity class negative or positive, but it still has low accuracy. Therefore, this study optimizes the Naïve Bayes algorithm with Particle Swarm Optimization (NB-PSO) to classify opinions from twitter feeds to get a good accuracy of public figures sentiment analysis. PSO used to select features to find optimization values to improve the accuracy of Naïve Bayes. There are four steps to optimize NB using PSO, i.e., initializing the population (swarm), calculate the accuracy value that matched with selected features, selected the best accuracy of classification, and updating position and velocity. From this study, the group of tweets was obtained based on the positive and negative sentiments from the community towards two Indonesia presidential candidates in 2019. The NB-PSO test shows the accuracy result of 90.74%. The result of accuracy increases by 4.12% of the NB algorithm. In conclusion, the inclusion of the Particle Swarm Optimization algorithm for Naïve Bayes classification algorithm gives a significant accuracy, especially for sentiment analysis cases.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2020-07-16</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/558</dc:identifier>
	<dc:identifier>10.15575/join.v5i1.558</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 5 No. 1 (2020); 81-88</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 5 No 1 (2020); 81-88</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v5i1</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/558/148</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2020 Jurnal Online Informatika</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-nd/4.0</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/564</identifier>
				<datestamp>2025-08-17T09:39:54Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Failover Cluster Nodes and ISCSI Storage Area Network on Virtualization Windows Server 2016</dc:title>
	<dc:creator>Abdullah, Mohammad Thoip</dc:creator>
	<dc:creator>Qidri, Sulhan</dc:creator>
	<dc:creator>Nuryadi, Wadi</dc:creator>
	<dc:creator>Widianto, Septian Rheno</dc:creator>
	<dc:subject xml:lang="en-US">Failover Cluster</dc:subject>
	<dc:subject xml:lang="en-US">iSCSI</dc:subject>
	<dc:subject xml:lang="en-US">Server</dc:subject>
	<dc:subject xml:lang="en-US">Storage Area Network</dc:subject>
	<dc:subject xml:lang="en-US">Storage Media</dc:subject>
	<dc:description xml:lang="en-US">The use of data in this current digital era, the traditional model of connecting the storage media with servers, cannot meet the need for fast access to a very large amount of data. Storage Area Network can be the solution because this technology can handle a large amount of storage media (TeraByte), enable to be a share of storage resources, as well as giving data access in real-time, quick, and easy. Internet Small Computer System Interface (iSCSI) is a concept of storage media that use Internet Protocol as a medium for connecting storage media and data transfer through network service. Testing of availability server in this research use failover cluster technology, after testing done, then the result is obtained, when a failure or error occurs on the primary server, the primary server role will be automatically replaced by backup server with the same resource as the main server. As for the time automatic displacement server, when an active server makes failure, then it will only take less than 5 seconds. So, it can be concluded that this technology can minimize the value of the downtime in the system.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2020-07-16</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/564</dc:identifier>
	<dc:identifier>10.15575/join.v5i1.564</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 5 No. 1 (2020); 89-96</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 5 No 1 (2020); 89-96</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v5i1</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/564/154</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2020 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<record>
			<header>
				<identifier>oai:ojs2.join.if.uinsgd.ac.id:article/569</identifier>
				<datestamp>2025-08-17T09:39:54Z</datestamp>
				<setSpec>join:ART</setSpec>
				<setSpec>driver</setSpec>
			</header>
			<metadata>
<oai_dc:dc
	xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
	http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Two-stage Gene Selection and Classification for a High-Dimensional Microarray Data</dc:title>
	<dc:creator>Rochayani, Masithoh Yessi</dc:creator>
	<dc:creator>Sa&#039;adah, Umu</dc:creator>
	<dc:creator>Astuti, Ani Budi</dc:creator>
	<dc:subject xml:lang="en-US">Classification and Regression</dc:subject>
	<dc:subject xml:lang="en-US">Feature selection</dc:subject>
	<dc:subject xml:lang="en-US">Gene expression</dc:subject>
	<dc:subject xml:lang="en-US">High-dimensional</dc:subject>
	<dc:subject xml:lang="en-US">Microarray</dc:subject>
	<dc:subject xml:lang="en-US">Tree</dc:subject>
	<dc:description xml:lang="en-US">Microarray technology has provided benefits for cancer diagnosis and classification. However, classifying cancer using microarray data is confronted with difficulty since the dataset has high dimensions. One strategy for dealing with the dimensionality problem is to make a feature selection before modeling. Lasso is a common regularization method to reduce the number of features or predictors. However, Lasso remains too many features at the optimum regularization parameter. Therefore, feature selection can be continued to the second stage. We proposed Classification and Regression Tree (CART) for feature selection on the second stage which can also produce a classification model. We used a dataset which comparing gene expression in breast tumor tissues and other tumor tissues. This dataset has 10,936 predictor variables and 1,545 observations. The results of this study were the proposed method able to produce a few numbers of selected genes but gave high accuracy. The model also acquired in line with the Oncogenomics Theory by the obtained of GATA3 to split the root node of the decision tree model. GATA3 has become an important marker for breast tumors.</dc:description>
	<dc:publisher xml:lang="en-US">Department of Informatics, UIN Sunan Gunung Djati Bandung</dc:publisher>
	<dc:date>2020-07-16</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://join.if.uinsgd.ac.id/index.php/join/article/view/569</dc:identifier>
	<dc:identifier>10.15575/join.v5i1.569</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Online Informatika; Vol. 5 No. 1 (2020); 9-18</dc:source>
	<dc:source xml:lang="id-ID">JOIN (Jurnal Online Informatika); Vol 5 No 1 (2020); 9-18</dc:source>
	<dc:source>2527-9165</dc:source>
	<dc:source>2528-1682</dc:source>
	<dc:source>10.15575/join.v5i1</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://join.if.uinsgd.ac.id/index.php/join/article/view/569/145</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2020 Jurnal Online Informatika</dc:rights>
</oai_dc:dc>
			</metadata>
		</record>
		<resumptionToken expirationDate="2026-04-05T16:46:40Z"
			completeListSize="278"
			cursor="0">07fdec3d49ceefeae051dbf650068300</resumptionToken>
	</ListRecords>
</OAI-PMH>
