{"title":"Perbandingan Algoritma Greedy Search dan Algoritma Depth-First-Search pada Pencarian Kota dengan Graph Romania Problem","authors":"M. Syuhada","doi":"10.31289/JITE.V1I2.1405","DOIUrl":"https://doi.org/10.31289/JITE.V1I2.1405","url":null,"abstract":"Pada jurnal ini, akan dibahas penggunaan algoritma Greedy Search dan Depth-First-Search untuk mencari sebuah kota ( final state) dari kota asal ( initial state ). Kedua algoritma akan dibandingkan berdasarkan total cost dari path yang terbentuk oleh pencarian masing-masing algoritma. Path yang digunakan adalah Romania Problem yang mana path ini sering digunakan pada kasus-kasus kecerdasan buatan. Jurnal ini juga mendiskusikan perbandingan antara kinerja kedua algoritma yang mana secara umum akan menunjukkan algoritma mana yang lebih efisien dalam menemukan solusi","PeriodicalId":43632,"journal":{"name":"Journal of Information Technology Education-Innovations in Practice","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2018-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79347678","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Sistem Pendeteksian Manusia untuk Keamanan Ruangan menggunakan Viola – Jones","authors":"J. Sianturi, R. Rahmat, Erna Budhiarti Nababan","doi":"10.31289/JITE.V1I2.1424","DOIUrl":"https://doi.org/10.31289/JITE.V1I2.1424","url":null,"abstract":"Aspek keamanan sangat dibutuhkan dalam berbagai kehidupan saat ini seperti keamanan rumah, gedung, atau ruangan yang memiliki nilai penting bagi pemilik. Keamanan dapat dikerjakan oleh tenaga manusia tetapi cara ini kurang efisien karena menghabiskan banyak resources seperti uang, waktu, tenaga dan juga sangat rentan terhadap kelalaian manusia ( human error ). Oleh karena itu diperlukan suatu pendetekatan untuk dapat melakukan keamanan tersebut.Salah satu pendekatan yang dapat dilakukan adalah dengan melakukan pendeteksian objek manusia melalui kamera yang terhubung dengan komputer.Dalam penelitian ini digunakan Viola-Jones untuk mendeteksi objek manusia dalam citra berdasarkan fitur. Citra yang diinput dari webcam dengan fungsi capture dalam library OpenCV diubah menjadi citra abu-abu setelah mengalami proses scaling , dilanjutkan ekualisasi histogram, perhitungan fitur dengan citra integral, dan pendeteksian objek dengan cascade of classifier . Pada penelitian ini ditunjukkan bahwa metode yang diajukan mampu melakukan pendeteksian objek dengan hasil akurasi mencapai 86,88% . Kata Kunci : viola - jones , pendeteksian manusia, keamanan ruangan, cascade of classifier , opencv.","PeriodicalId":43632,"journal":{"name":"Journal of Information Technology Education-Innovations in Practice","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2018-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79608631","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Model Identifikasi dan Analisis Risiko Rantai Pasok Agroindustri Kopi Gayo dengan Pendekatan Fuzzy Analytichal Hierarchy Process","authors":"M. Yustisar","doi":"10.31289/jite.v1i2.1425","DOIUrl":"https://doi.org/10.31289/jite.v1i2.1425","url":null,"abstract":"Kopi Gayo merupakan salah satu komoditi pertanian utama provinsi Aceh selain kopi, nilam, pinang dan kelapa sawit. Upaya mencapai rantai pasok yang berkelanjutan, perlu diperhatikan tiga aspek yang menjadi pilar yaitu ekonomi, sosial dan lingkungan. Manajemen rantai pasok pertanian terutama kopi Gayo umumnya lebih sulit ditangani dibandingkan dengan produk manufaktur karena produk pertanian memiliki sifat cepat rusak, ukuran bervariasi, musiman, lokasi tersebar dan skala kecil, sehingga sangat rentan terhadap risiko kerugian bagi pelakunya. Fakta saat ini menunjukkan bahwa beberapa aspek belum menunjukkan kondisi keberlanjutan, seperti pada indikator profit usaha petani, keterampilan pelaku, penggunaan air pada proses produksi jauh di atas ambang batas, pengelolaan risiko rantai pasok serta pola hubungan keterkaitan antar pelaku. Tujuan dari penelitian ini mengetahui faktor-faktor risiko yang paling berpengaruh dan analisis interaksi antar pelaku untuk bersama-sama mengelola risiko dalam struktur rantai pasok kopi Gayo. Metode yang digunakan adalah sintesis logika Fuzzy Analytichal Hierarchy Process (F-AHP) dan proses hirarki analitik, sedangkan analisis interrelasi dilakukan secara deskriptif. Hasil Fuzzy AHP menunjukkan bahwa pada petani, risiko terbesar adalah mutu dan budidaya, pada pedagang pengepul adalah pemenuhan mutu dan harga, pada agroindustri risiko terbesar adalah mutu dan harga. Kata Kunci : Agroindustri Kopi Gayo; Fuzzy Analytichal Hierarchy Process ; Risiko Rantai Pasok","PeriodicalId":43632,"journal":{"name":"Journal of Information Technology Education-Innovations in Practice","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2018-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89431118","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"KLASIFIKASI EKSPRESI WAJAH MENGGUNAKAN BAG OF VISUAL WORDS","authors":"Muhathir Muhathir","doi":"10.30743/infotekjar.v2i2.181","DOIUrl":"https://doi.org/10.30743/infotekjar.v2i2.181","url":null,"abstract":"Pada hakikatnya, manusia dapat membedakan pola terhadap suatu objek berdasarkan bentuk visual yang mengandung keadaan emosional. Seperti membedakan ekspresi wajah seseorang pada suatu citra. Manusia dapat membedakan ekspresi pada citra tersebut secara kasat mata. Namun komputer yang tidak dapat mengenali ekspresi wajah tersebut. Bag of visual words merupakan suatu skema untuk mengklasifikasikan citra berdasarkan nilai-nilai pixel pada citra. Dengan menggunakan deteksi interest point dan ekstraksi interest point, bag of visual words mengambil ciri unik pada citra sehingga dapat membedakan pola-pola yang terdapat pada suatu citra. Bag of visual word dengan nilai K 500 mampu mengklasifikasi pola ekspresi wajah dengan tingkat akurasi 69%, Kata kunci : Wajah, Klasifikasi, Speed-up Robust Feature, Bag of visual words, Ekspresi","PeriodicalId":43632,"journal":{"name":"Journal of Information Technology Education-Innovations in Practice","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2018-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74554747","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Perancangan Kunci Public RSA dan ElGamal pada Kriptografi untuk Kemananan Informasi","authors":"S. Susilawati","doi":"10.31289/JITE.V1I2.1429","DOIUrl":"https://doi.org/10.31289/JITE.V1I2.1429","url":null,"abstract":"Penggunaan bilangan prima berukuran sangat besar pada kriptografi kunci public sangat diperlukan untuk menghindari proses dekripsi pesan secara tidak sah. Dalam implementasinya, pembangkitan bilangan prima berukuran sangat besar ini terkendala pada operasi perpangkatan dengan bilangan yang besar. Makalah ini membahas teknik pembangkitan bilangan berukuran sangat besar menggunakan algoritma Linear Congruential Generator (LCG) serta pengujian bilangan prima secara probabilistik menggunakan algoritma Miller-Rabin. Bilangan prima yang dihasilkan diuji dan dianalisa pada sistem kriptografi kunci public RSA dan ElGamal dengan tujuan untuk keamanan informasi.","PeriodicalId":43632,"journal":{"name":"Journal of Information Technology Education-Innovations in Practice","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2018-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91306712","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"How Many Monte-Carlo Simulations Are Needed to Adequately Process Interval Uncertainty: An Explanation of the Smart Electric Grid-Related Simulation Results","authors":"Afshin Gholamy, V. Kreinovich","doi":"10.12988/JITE.2018.812","DOIUrl":"https://doi.org/10.12988/JITE.2018.812","url":null,"abstract":"One of the possible ways of dealing with interval uncertainty is to use Monte-Carlo simulations. A recent study of using this technique for the analysis of different smart electric grid-related algorithms shows that we need approximately 500 simulations to compute the corresponding interval range with 5% accuracy. In this paper, we provide a theoretical explanation for these empirical results. 1 Formulation of the Problem Need for interval uncertainty. Data processing means processing measurement results. Measurements are never absolutely accurate: the result x̃ of measuring a physical quantity is, in general, somewhat different from the actual (unknown) value x of the corresponding quantity. In the ideal case, we should know which values of the measurement error ∆x def = x̃ − x are possible, and what is the probability of different possible values. These probabilities can be determined if we have a sufficiently large number of situations in which: • we know the exact values (to be more precise, we have very good estimates of the exact values) and • we also have measurement results.","PeriodicalId":43632,"journal":{"name":"Journal of Information Technology Education-Innovations in Practice","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72994385","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Another rational analytical approximation to the Thomas-Fermi equation","authors":"W. Robin","doi":"10.12988/JITE.2018.823","DOIUrl":"https://doi.org/10.12988/JITE.2018.823","url":null,"abstract":"A new rational analytic approximation to the solution of the Thomas-Fermi boundary value problem is presented. The approximation is a development of the original conception of J.C. Mason [5] and has been developed to reproduce the numerical work of Parand et al [11], as far as proved feasible. The fit to the numerical data, by a basic collocation process applied to the rational approximation, proved excellent. Mathematics Subject Classification: 34A34, 34A45, 34B15, 34B40, 65L60","PeriodicalId":43632,"journal":{"name":"Journal of Information Technology Education-Innovations in Practice","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73405936","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Comparing US and Russian Grading Scales","authors":"O. Kosheleva, V. Kreinovich","doi":"10.12988/JITE.2018.896","DOIUrl":"https://doi.org/10.12988/JITE.2018.896","url":null,"abstract":"In the US, grades are usually based on comprehensive written exams: the larger the proportion of topic in which the student shows knowledge, the higher the student’s grade. In contrast, in Russia, the grades are based on oral exams, and the bulk of the grade comes from a student answering questions of a few (usually, three) randomly selected topics. A natural question is: what is the relation between the two grading scales? It turns out that “excellent” and “good” grades means the same in both scales, while the US “satisfactory” level is higher than a similar Russian level. Mathematics Subject Classification: 97B70","PeriodicalId":43632,"journal":{"name":"Journal of Information Technology Education-Innovations in Practice","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88711411","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Perancangan Link Komunikasi Jaringan Akses Seluler Untuk Aplikasi Cdma 2000-1x Di Kabupaten Bima, Nusa Tenggara Barat","authors":"Syarifah Muthia Putri","doi":"10.31289/JITE.V1I1.573","DOIUrl":"https://doi.org/10.31289/JITE.V1I1.573","url":null,"abstract":"Pemerataan pembangunan di seluruh wilayah Indonesia dilakukan pada bidang pendidikan, transportasi, tenaga listrik, pengairan, air bersih, dan juga telekomunikasi. Telekomunikasi saat ini sudah menjadi kebutuhan primer bagi masyarakat. Perancangan link komunikasi jaringan akses seluler untuk aplikasi CDMA 2000-1x di kabupaten Bima, Nusa Tenggara Barat diharapkan dapat menjadi referensi untuk pembangunan telekomunikasi pada wilayah urban, sub urban, dan rural. Berdasarkan data di kabupaten Bima diperlukan 12 sel pada daerah urban dengan OBQ 403.66 kbps/km 2 , 4 sel pada wilayah sub urban dengan OBQ 427.87 kbps/km 2 , dan 1 sel pada wilayah rural dengan OBQ 411.67 kbps/km 2 . Kata Kunci : CDMA, OBQ, JaringanNirkabel","PeriodicalId":43632,"journal":{"name":"Journal of Information Technology Education-Innovations in Practice","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2017-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74309499","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Implementasi Algoritma Apriori Pada Data Benchmark Kosarak Dan Mushrooms","authors":"R. Muliono","doi":"10.31289/JITE.V1I1.572","DOIUrl":"https://doi.org/10.31289/JITE.V1I1.572","url":null,"abstract":"Algoritma apriori saat ini lebih banyak digunakan untuk mencari frequent itemsets dan mencari aturan asosiasi untuk menemukan knowledge. Proses mencari frequent itemsets pada data secara berulang-ulang yang ada didalam database dan diakhiri ketika kandidat itemsets sampai K+1 tidak ada lagi. Algorima Apriori menggunakan secara umum menggunakan banyak jumlah memori dan waktu eksekusi dalam menemukan kombinasi dan perbandingan frequent itemsets. Hasil yang di dapatkan dengan menggunakan algoritma apriori bisa di katakan akurat saat menseleksi kombinasi itemset yang ada pada dataset sesuai dengan nilai support dan confidens nya. Untuk mengetahui seberapa akurat dan berapa jumlah sumberdaya yang di gunakan serta bagaimana perilaku algoritma apriori terhadap dataset dengan jumlah kolom data yang berbeda, maka implementasi agoritma apriori di ujikan dengan data benchmark kosarak.dat dan mushrooms.dat dengan nilai minimum support yang sama. Kedua data sets tersebut memiliki format yang berbeda pada jumlah kolom datanya yaitu data pada semua baris memiliki jumlah kolom karakter data, pada datasets kosarak.datmemiliki kolom karakter dengan panjang berbeda-beda pada setiap barisnya sedangkan pada datasets mushrooms.dat memiliki kolom karakter sebanyak 23 karakter data, artinya datasets tersebut memiliki model blok data linear atau sama. Hasil dari implementasi algoritma apriori terhadap kedua datasets tersebut didapatkan perilaku proses pada apriori yang ditampilkan dari hasil waktu eksekusi dan memori yang dipakai bahwa datasets kosarak lebih sedikit menggunakan waktu dibandingkan dengan datasets mushrooms namun penggunaan memori lebih boros, semakin kecil nilai minimum support semakin banyak komparasi kandidat yang dicari. Kata Kunci : apriori; datamining ; implementasi; kosarak; mushrooms","PeriodicalId":43632,"journal":{"name":"Journal of Information Technology Education-Innovations in Practice","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2017-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79584677","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}