发布求助
文献互助 智能选刊 最新文献

Ultimatics : Jurnal Teknik Informatika最新文献

筛选
英文 中文
Implementasi Metode Double Exponential Smoothing dalam Memprediksi Pertambahan Jumlah Penduduk di Wilayah Kabupaten Karawang
Ultimatics : Jurnal Teknik Informatika Pub Date : 2020-12-29 DOI: 10.31937/TI.V12I2.1688
Andini Diyah Pramesti, M. Jajuli, Betha Nurina Sari
{"title":"Implementasi Metode Double Exponential Smoothing dalam Memprediksi Pertambahan Jumlah Penduduk di Wilayah Kabupaten Karawang","authors":"Andini Diyah Pramesti, M. Jajuli, Betha Nurina Sari","doi":"10.31937/TI.V12I2.1688","DOIUrl":"https://doi.org/10.31937/TI.V12I2.1688","url":null,"abstract":"The density and uneven distribution of the population in each area must be considered because it will cause problems such as the emergence of uninhabitable slums, environmental degradation, security disturbances, and other population problems. In the data obtained from the 2010 population census based on the level of population distribution in Karawang District, the area of West Karawang, East Karawang, Rengasdengklok, Telukjambe Timur, Klari, Cikampek and Kotabaru are zone 1 regions which are the densest zone with a population of 76,337 people up to 155,471 inhabitants. This research predicts / forecasting population growth in the 7 most populated areas for the next 1 year using Double Exponential Smoothing Brown and Holt methods. This study uses Mean Absolute Percentage Error (MAPE) to evaluate the performance of the double exponential smoothing method in predicting per-additional population numbers. Forecasting results from the two methods place the Districts of East Telukjambe, Cikampek, Kotabaru, East Karawang, and Rengasdengklok in 2020 to remain in zone 1 with a range of 76,337 people to 155,471 inhabitants. Whereas in the Districts of Klari and West Karawang are outside the range in zone 1 because both districts have more population than the range in zone 1. From the results of MAPE both methods are found that 6 out of 7 districts in the method Holt's double exponential smoothing produces a smaller MAPE value compared to the MAPE value generated from Brown's double exponential smoothing method. It was concluded that in this study the Holt double exponential smoothing method was better than Brown's double exponential smoothing method.","PeriodicalId":347196,"journal":{"name":"Ultimatics : Jurnal Teknik Informatika","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127362457","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}
引用次数: 1
Implementasi Algoritma Support Vector Machine dan Chi Square untuk Analisis Sentimen User Feedback Aplikasi
Ultimatics : Jurnal Teknik Informatika Pub Date : 2020-12-29 DOI: 10.31937/TI.V12I2.1828
Lu'lu' Luthfiana, J. Young, A. Rusli
{"title":"Implementasi Algoritma Support Vector Machine dan Chi Square untuk Analisis Sentimen User Feedback Aplikasi","authors":"Lu'lu' Luthfiana, J. Young, A. Rusli","doi":"10.31937/TI.V12I2.1828","DOIUrl":"https://doi.org/10.31937/TI.V12I2.1828","url":null,"abstract":"In order to adapt with evolving requirements and perform continuous software maintenance, it is essential for the software developers to understand the content of user feedback. User feedback such as bug report could provide so much information regarding the product from user’s point of view, especially parts that need improvements. However, it is often difficult to read all the feedback for products with enormous number of users as manually reading and analyzing each feedback could take too much time and effort. This research aims to develop a model for automatic feedback classification by implementing Support Vector Machine for the classifier’s algorithm and Chi-square method for feature selection. The model is developed using Python programming language and is then evaluated under different scenarios in order to measure its performance. Using a ratio of training and testing set of 80:20, our model achieved 77% accuracy, 50% precision, 55% recall, and 73% F1-score with 6.63 critical value and C=100 and gamma 0.001 as the SVM hyperparameters.","PeriodicalId":347196,"journal":{"name":"Ultimatics : Jurnal Teknik Informatika","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115745804","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}
引用次数: 4
Rancang Bangun Aplikasi e-Commerce Dropship Berbasis Web
Ultimatics : Jurnal Teknik Informatika Pub Date : 2020-12-29 DOI: 10.31937/TI.V12I2.1823
Alexander Waworuntu
{"title":"Rancang Bangun Aplikasi e-Commerce Dropship Berbasis Web","authors":"Alexander Waworuntu","doi":"10.31937/TI.V12I2.1823","DOIUrl":"https://doi.org/10.31937/TI.V12I2.1823","url":null,"abstract":"Inabay is a small business that provides various types of products from stationery to food supplements which are distributed through dropship mechanism. The transaction process with drop shippers are still carried out conventionally with a large number of drop shippers/resellers, causes resellers unable to monitor product stock in real-time. Therefore, Inabay develops a web-based e-commerce application that can be used by resellers to make purchases of goods and monitor the movement of stock quantities. The application development process adapts the Rapid Application Development method and uses the PHP programming language with Laravel framework and MariaDB database. User acceptance of the application is evaluated using the Technology Acceptance Model with the results of 88% perceived ease of use and 96% perceived usefulness.","PeriodicalId":347196,"journal":{"name":"Ultimatics : Jurnal Teknik Informatika","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131921721","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}
引用次数: 1
Perbandingan Performa Histogram Equalization untuk Peningkatan Kualitas Gambar Minim Cahaya pada Android 对安卓系统光敏图像质量的直方图匹配
Ultimatics : Jurnal Teknik Informatika Pub Date : 2020-12-29 DOI: 10.31937/TI.V12I2.1667
Claudia Kenyta, Daniel Martomanggolo Wonohadidjojo
{"title":"Perbandingan Performa Histogram Equalization untuk Peningkatan Kualitas Gambar Minim Cahaya pada Android","authors":"Claudia Kenyta, Daniel Martomanggolo Wonohadidjojo","doi":"10.31937/TI.V12I2.1667","DOIUrl":"https://doi.org/10.31937/TI.V12I2.1667","url":null,"abstract":"When the photos are taken in low light condition, the quality of the results will not meet their expectation. Image Enhancement method can be used to enhance the quality of the photos taken in low light condition. One of the algorithms used is called Histogram Equalization (HE), that works using Histogram basis. The superiority of HE algorithm in enhancing the quality of the photos taken in low light condition is the simplicity of the algorithm itself and it does not need a high specification device for the algorithm to run. One variant of HE algorithm is Contrast Limited Adaptive Histogram Equalization (CLAHE). This paper shows the implementation of HE algorithm and its performance in enhancing the quality of photos taken in low light condition on Android based application and the comparison with CLAHE algorithm. The results show that, HE algorithm is better than CLAHE algorithm.","PeriodicalId":347196,"journal":{"name":"Ultimatics : Jurnal Teknik Informatika","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131372819","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}
引用次数: 0
Perbandingan Algoritma Convex Hull: Jarvis March dan Graham Scan 凸包算法:Jarvis March dan Graham Scan
Ultimatics : Jurnal Teknik Informatika Pub Date : 2020-12-29 DOI: 10.31937/TI.V12I2.1800
F. Tobing, Prayogo
{"title":"Perbandingan Algoritma Convex Hull: Jarvis March dan Graham Scan","authors":"F. Tobing, Prayogo","doi":"10.31937/TI.V12I2.1800","DOIUrl":"https://doi.org/10.31937/TI.V12I2.1800","url":null,"abstract":"Comparison of algorithms is needed to determine the level of efficiency of an algorithm. The existence of a speed comparison in an algorithm that will make a unique shape is sometimes a problem that must be solved by comparing one algorithm with another. This problem can be solved by using Jarvis March and Graham Scan where this algorithm will create a unique shape of a point followed by testing the speed comparison of the two algorithms and the result can be stated that the Graham Scan algorithm in general works faster than the algorithm Jarvis March.","PeriodicalId":347196,"journal":{"name":"Ultimatics : Jurnal Teknik Informatika","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124543106","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}
引用次数: 0
Pengenalan Wajah Bebas Ekspresi Menggunakan Metode Nearest Feature Line dengan Representasi Ciri dalam Ruang Eigen 面部自由表达识别采用了新的途径来表现Eigen空间的特征
Ultimatics : Jurnal Teknik Informatika Pub Date : 2020-07-02 DOI: 10.31937/TI.V12I1.1562
Is Mardianto
{"title":"Pengenalan Wajah Bebas Ekspresi Menggunakan Metode Nearest Feature Line dengan Representasi Ciri dalam Ruang Eigen","authors":"Is Mardianto","doi":"10.31937/TI.V12I1.1562","DOIUrl":"https://doi.org/10.31937/TI.V12I1.1562","url":null,"abstract":"Pengenalan wajah dengan ekspresi berbeda adalah salah satu bagian dari masalah pengenalan pola yang cukup kompleks jika dibandingkan dengan pengenalan pola pada profil normal.Metode pengenalan wajah bebas ekspresi menggunakan teknik Nearest Feature Line (NFL) bekerja dengan menemukan jarak proyeksi terdekat antara vektor ciri, dengan asumsi bahwa semakin dekat jarak proyeksi vektor ciri (wajah) ke vektor ciri (wajah) lainnya, maka lebih mirip sifat akan vektor ciri fisik (wajah) yang berdekatan. Perhitungan jarak NFL dilakukan pada ruang dimensi eigen dengan tujuan agar dimensi ciri vektor (wajah) memiliki dimensi yang jauh lebih kecil untuk meningkatkan tingkat akurasi pengenalan dan mempercepat waktu komputasi.Hasil pengujian yang diperoleh menunjukkan metode NFL memberikan tingkat akurasi pengenalan yang cukup baik pada nilai rata-rata akurasi 76,7% dengan keunggulan waktu komputasi yang rendah jika dibandingkan dengan metode cerdas lainnya seperti sistem jaringan saraf tiruan.","PeriodicalId":347196,"journal":{"name":"Ultimatics : Jurnal Teknik Informatika","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132522000","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}
引用次数: 0
Kombinasi Backpropagation dan Hopfield Modifikasi untuk Persamaan Polynomial
Ultimatics : Jurnal Teknik Informatika Pub Date : 2020-07-02 DOI: 10.31937/TI.V12I1.1627
Rina Pramitasari, Imam Rofiki
{"title":"Kombinasi Backpropagation dan Hopfield Modifikasi untuk Persamaan Polynomial","authors":"Rina Pramitasari, Imam Rofiki","doi":"10.31937/TI.V12I1.1627","DOIUrl":"https://doi.org/10.31937/TI.V12I1.1627","url":null,"abstract":"Tujuan artikel ini mencari akar untuk menyelesaikan persamaan polynomial. Dimana tingkat keamanan dari system kriptografi kunci public adalah pada permasalahan matematika yang sulit dipecahkan. Sehingga Salah satunya adalah kriptografi kunci public multivariat. Untuk mengkriptanalisis tersebut adalah menyelesaikan sistem persamaan polynomial multivariat atas lapangan hingga. Penelitian ini dilakukan dengan kombinasi metode backpropagarian dan Hopfield modifikasi. Hasil penelitian menunjukkan lebih baik dari pada metode Hopfield Modifikasi saja. Karena menjamin nilai awal yang diberikan metode Hopfield modifikasi dimana selalu dekat dengan nilai optimal. Pendekatan ini memberikan solusi yang akurat.","PeriodicalId":347196,"journal":{"name":"Ultimatics : Jurnal Teknik Informatika","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130415532","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}
引用次数: 1
Visualisasi Algoritma sebagai Sarana Pembelajaran K-Means Clustering 可视化算法作为学习的手段
Ultimatics : Jurnal Teknik Informatika Pub Date : 2020-07-02 DOI: 10.31937/TI.V12I1.1523
Alethea Suryadibrata, Julio Christian Young
{"title":"Visualisasi Algoritma sebagai Sarana Pembelajaran K-Means Clustering","authors":"Alethea Suryadibrata, Julio Christian Young","doi":"10.31937/TI.V12I1.1523","DOIUrl":"https://doi.org/10.31937/TI.V12I1.1523","url":null,"abstract":"Algorithm Visualization (AV) is often used in computer science to represents how an algorithm works. Educators believe that visualization can help students to learn difficult algorithms. In this paper, we put our interest in visualizing one of Machine Learning (ML) algorithms. ML algorithms are used in various fields. Some of the algorithms are used to classify, predict, or cluster data. Unfortunately, many students find that ML algorithms are hard to learn since some of these algorithms include complicated mathematical equations. We hope this research can help computer science students to understand K-Means Clustering in an easier way.","PeriodicalId":347196,"journal":{"name":"Ultimatics : Jurnal Teknik Informatika","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134360110","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}
引用次数: 2
Peramalan Utilisasi Perangkat Jaringan dan Bandwidth Dengan Metode Holt-Winters dan Multi Layer Perceptron 组织设备和带宽均采用Holt-Winters和多层Perceptron方法
Ultimatics : Jurnal Teknik Informatika Pub Date : 2020-07-02 DOI: 10.31937/TI.V12I1.1575
Muhammad Taufiq, Dedy Sugiarto, Abdul Rochman
{"title":"Peramalan Utilisasi Perangkat Jaringan dan Bandwidth Dengan Metode Holt-Winters dan Multi Layer Perceptron","authors":"Muhammad Taufiq, Dedy Sugiarto, Abdul Rochman","doi":"10.31937/TI.V12I1.1575","DOIUrl":"https://doi.org/10.31937/TI.V12I1.1575","url":null,"abstract":"Perangkat jaringan menjadi media penting untuk perpindahan data dari satu node ke node lain baik berupa switch, router ataupun perangkat kemananan jaringan. Kehandalan dari perangkat jaringan harus tetap terjaga baik dari sisi sumber daya perangkat ataupun bandwidth. Penelitian dilakukan dengan menerapkan metode Holt-Winters Dan Multi Layer Perceptron (MLP) pada data utilisasi perangkat jaringan dan bandwidth. Kedua metode tersebut dibandingkan untuk menilai akurasi mana yang lebih baik jika diterapkan pada data utilisasi perangkat jaringan dan bandwitdh dengan menghitung Root Mean Squared Error (RMSE) dan Mean Absolute Percentage(MAPE). Hasil dari pengukuran akurasi pada data uji perangkat jaringan dengan MLP menghasilkan nilai RMSE 11.16 dan MAPE 2.34, dan dengan Holt-Winters menghasilkan nilai RMSE 14.56 dan MAPE 2.95. Sedangkan Hasil dari pengukuran akurasi pada data uji bandwidth dengan MLP menghasilkan nilai RMSE 0.13 dan MAPE 7.27, dan dengan Holt-Winters menghasilkan nilai RMSE 2.59 dan 134.31. Berdasarkan hasil pengukuran tersebut disimpulkan bahwa metode MLP memiliki nilai kesalahan (error) lebih kecil  dibandingkan dengan metode Holt-Winters yang diterapkan pada data utilisasi perangkat jaringan dan bandwidth dengan rentang waktu data histori 3 tahun","PeriodicalId":347196,"journal":{"name":"Ultimatics : Jurnal Teknik Informatika","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121024617","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}
引用次数: 0
Gray Level Co-ocurence Matrix untuk Pengekstrasian Ciri Topeng Cirebon
Ultimatics : Jurnal Teknik Informatika Pub Date : 2020-07-02 DOI: 10.31937/TI.V12I1.1507
F. Kurniadi, Vinnia Kemala Putri
{"title":"Gray Level Co-ocurence Matrix untuk Pengekstrasian Ciri Topeng Cirebon","authors":"F. Kurniadi, Vinnia Kemala Putri","doi":"10.31937/TI.V12I1.1507","DOIUrl":"https://doi.org/10.31937/TI.V12I1.1507","url":null,"abstract":"Topeng Cirebon merupakan salah satu kekayaan budaya dalam Indonesia. Salah satunya adalah Topeng Cirebon yang merupakan salah satu identitas yang tidak terpisahkan dalam budaya kota Cirebon. Sayangnya, orang-orang tidak terlalu tertarik dengan kebudayaan daerah dan kurangnya bantuan pemerintahan setempat membuat topeng Cirebon semakin ditinggalkan. Hal ini ditakutkan dikemudian hari topeng Cirebon akan dilupakan. Tujuan utama dari penelitian ini adalah melakukan digitalisasi topeng Cirebon dan identifikasi secara automatis menggunakan pendekatan pengolahan citra. Penelitian ini menggunakan Gray Level Co-occurence Matrix sebagai fitur utama dan K-Nearest Neighbour sebagai klasifier. Hasil akurasi terbaik dari penelitian ini adalah sebesar 40.67%","PeriodicalId":347196,"journal":{"name":"Ultimatics : Jurnal Teknik Informatika","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131408630","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}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信