Garuda - Garba Rujukan Digital

p-Index From 2020 - 2025

1.704

P-Index

This Author published in this journals

All Journal Jurnal Inovasi Teknologi Pendidikan Proceeding of the Electrical Engineering Computer Science and Informatics Jurnal SOLMA International Journal of New Media Technology Jurnal ULTIMA InfoSys Jurnal ULTIMATICS Jurnal ULTIMA Computing Jurnal Inovasi Informatika JURPIKAT (Jurnal Pengabdian Kepada Masyarakat) Prosiding Konferensi Nasional PKM-CSR Aptekmas : Jurnal Pengabdian Kepada Masyarakat Prioritas : Jurnal Pengabdian Kepada Masyarakat

Adhi Kusnadi

Universitas Multimedia Nusantara

Author-ID : 3174211

Religion Aerospace Engineering Agriculture, Biological Sciences & Forestry Arts Humanities Astronomy Automotive Engineering Biochemistry, Genetics & Molecular Biology Chemical Engineering, Chemistry & Bioengineering Chemistry Civil Engineering, Building, Construction & Architecture Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Dentistry Earth & Planetary Sciences Economics, Econometrics & Finance Education Electrical & Electronics Engineering Energy Engineering Environmental Science Health Professions Immunology & microbiology Industrial & Manufacturing Engineering Languange, Linguistic, Communication & Media Law, Crime, Criminology & Criminal Justice Library & Information Science Materials Science & Nanotechnology Mathematics Mechanical Engineering Medicine & Pharmacology Neuroscience Nursing Physics Public Health Social Sciences Transportation Veterinary Other

Published : 24 Documents Claim Missing Document

Claim Missing Document

Articles

Title

Perbandingan Algoritma Horspool dan Algoritma Zhu-Takaoka dalam Pencarian String Berbasis Desktop Adhi Kusnadi; Abraham Khrisnandi Wicaksono
Ultima Computing : Jurnal Sistem Komputer Vol 9 No 1 (2017): Ultima Computing : Jurnal Sistem Komputer
Publisher : Faculty of Engineering and Informatics, Universitas Multimedia Nusantara

String searching is the search process by using the index to find text that can help in information retrieval systems. Continuing previous research, this study uses an algorithm Horspool and Zhu-Takaoka to find the performance of each of these algorithms in the search for a pattern in the text. So they make a useful desktop-based application to measure performance of both algorithm, particulary the time required to perform string searching process. Using the method of prototyping and Microsoft Visual Studio with C# programming language implementation. Result obtained from this application is the number of words found, and the processing time of each algorithm. From this study, the Horspool algorithm is 19,82845 percent faster in first test with the pattern "swan" in a text file 50 multiples 1000 words and 15.9442 percent in the second trial using text files 70000 words with different pattern than the number of characters Zhu algorithm -Takaoka in the process of searching string. Index Terms-String searching, Horspool, Zhu-Takaoka, Microsoft Visual Studio, application, processing time.

Implementasi Algoritma Prim Dalam Penentuan Ikatan Senyawa Kimia Olivia Benazir Ester Tiwow; Adhi Kusnadi
Ultima Computing : Jurnal Sistem Komputer Vol 9 No 2 (2017): Ultima Computing : Jurnal Sistem Komputer
Publisher : Faculty of Engineering and Informatics, Universitas Multimedia Nusantara

This research concerns the implementation of Prim algorithm in the determination of bond of a chemical compound. By doing a minimum spanning tree search of a weight graph that has been created. Input from the user in the form of chemical compounds will be processed so that the compound can be divided into elements that will act as nodes on the prime algorithm. Weight of the tangent node is obtained from the comparison of the minimum number of atoms that can react between the two elements that will be bonded to each other. Applications developed on the basis of the web by considering the functionality of the design can be accessed by many people. System design is poured into HTML and Javascript programming language. All design functionality is poured into the Javascript programming language. This study is still limited to programs that can only process the input of compounds that are in class A in the periodic table. And preformed compounds such as SO42-, HO3-. This application has an accuracy rate of 77.41% and 66.67% of testers said that this application is useful for Indonesian education. Index Terms—Chemical Compound, prim algoritm, minimum spanning tree, website, Javascript.

Implementasi Metode Entropy dan Topsis Dalam Sistem Pendukung Keputusan Pemilihan Karyawan Terbaik Mitha Anggreani Rupang; Adhi Kusnadi
Ultima Computing : Jurnal Sistem Komputer Vol 10 No 1 (2018): Ultima Computing : Jurnal Sistem Komputer
Publisher : Faculty of Engineering and Informatics, Universitas Multimedia Nusantara

Employee is a part of the company's most important asset in its efforts to maintain survival, growth, ability to compete and profit. At this time the process of assessment of employees in Jakarta Smart City is still in the form of manual and the decision only from one party only, so the process is still not accurate. So it takes the methods that must be able to replace that system. For that reason, a Decision Support System (SPK) was created to determine the best employees in Jakarta Smart City. In the system implemented the method of Entropy and TOPSIS. Entropy method can be trusted in determining the weight of the criteria to be used. And TOPSIS method can quickly perform the ranking process. Criteria to be used are quality and quantity of work, obedience, cooperation, morale, and work discipline. The index of satisfaction level of respondents to the decision support system ranges from 70% -80%, meaning that the assessment of the system created gives results at a fairly good level. Index Terms—employee, nter key words or phrases in alphabetical order, separated by commas

Pengenalan Tulisan Tangan Offline Dengan Algoritma Generalized Hough Transform dan Backpropagation Farica Perdana Putri; Adhi Kusnadi
Ultima Computing : Jurnal Sistem Komputer Vol 10 No 1 (2018): Ultima Computing : Jurnal Sistem Komputer
Publisher : Faculty of Engineering and Informatics, Universitas Multimedia Nusantara

Offline handwriting recognition is a technique used to recognize handwriting in paper document which converting it to digital form. Each handwriting has a unique style and shape that can be used to identify the owner. This research aims to develop a method to recognize the digital data handwriting. The method combines two algorithms; the first is Generalized Hough Transform in feature extraction process to detect arbitrary objects on the image; the second algorithm is Backpropagation to train the neural network based on feature values from feature extraction process. Artificial Neural Network (ANN) is used to improve the accuracy of the recognition system. The experiments are performed by using 100 handwriting images of 10 different people. The number of hidden units is defined through experiment to obtain optimal neural network. The experiment result shows that the recognition accuracy is up to 80%. Index Terms—Artificial Neural Network, Backrpopagation, Generalized Hough Transform, Offline handwiritng recognition

Perbandingan Algoritma C-Means Clustering dan Fuzzy C-Means Clustering adhi kusnadi; Abi Kabisah Maulillah
Ultima Computing : Jurnal Sistem Komputer Vol 11 No 1 (2019): Ultima Computing : Jurnal Sistem Komputer
Publisher : Faculty of Engineering and Informatics, Universitas Multimedia Nusantara

Salah satu operasi di dalam analisis citra adalah segmentasi citra. Pada mulanya proses segmentasi dilakukan untuk memisahkan objek dari latar belakangnya, sehingga segmentasi merupakan bagian penting dalam pengenalan objek. Saat ini segmentasi sudah mengalami perkembangan yang sangat pesat, bukan hanya untuk tujuan pengenalan objek saja tetapi juga untuk persoalan interpretasi citra, yaitu untuk mengetahui objek-objek yang termuat dalam suatu citra. Banyak algoritma sudah dikembangkan untuk proses segmentasi citra. Beberapa di antaranya adalah algoritma C-Means Clustering dan Fuzzy C-Means Clustering. Pada peneltian ini, dilakukan perbandingan antara algoritma C-Means Clustering dan Fuzzy C-Means Clustering dalam segmentasi citra. Dari beberapa hasil percobaan yang didapat dalam penelitian ini berupa sisi waktu atau kecepatan, ketelitian dan pengulangan, maka dapat disimpulkan algoritma Fuzzy C-Means Clustering adalah algoritma yang terbaik yang dapat digunakan dalam segmentasi citra karena dalam algoritma Fuzzy C-Means Clustering terdapat nilai keanggotaan atau fuzzy yang secara iteratif diperbaiki hingga mencapai keadaan konvergen.

Pengenalan Pola Tulang Daun Dengan Jaringan Syaraf Tiruan Backpropagation Alvin Hanjaya Tandrian; Adhi Kusnadi
Ultima Computing : Jurnal Sistem Komputer Vol 10 No 2 (2018): Ultima Computing : Jurnal Sistem Komputer
Publisher : Faculty of Engineering and Informatics, Universitas Multimedia Nusantara

The development of technology has affected many areas of life. Progress in the field of Computer Science can reach other aspect of science. This research apply the knowledge of Computer Science in Biological Science, the one is the morphology of leaf venation. Leaf venation is an important aspect in the process of identification. Therefore, in this research developed thesystem that classify the type of leaf venation. This application is used as means of research on the performance of pattern recognition on backpropagation neural network. The system designed using the Java programming and socket programming to transfer data from the mobile device into the computer. Data testing is implemented using Android to facilitate process oftaking the picture. While in the process of training data for the optimal weight applied directly on the server computer by using Java Eclipse. In the stage of image processing is implemented by using the library of Canny edge detection. Data consisted of five categories of leaf vein pattern, with a sample of three leaves for each pattern. Training data using two of the three leaves for each pattern, with 10 images each leaf so that there are 20 images for each pattern, with a total of 100 images for all patterns. Data testing use 10 images from the third leaf to count the accuracy. The system managed to getthe best accuracy by using an image size of 200 x 200 with 100 hidden node with the average accuracy of 76%. Index Terms— Android, Canny Edge Detection, Java, Neural Networks Backpropagation, Socket Programming

Co-Authors Abi Kabisah Maulillah Abraham Khrisnandi Wicaksono Alethea Suryadibrata Alvin Hanjaya Tandrian Angga Aditya Permana Anggita Nauli Marpaung Daniel Daniel Dennis Gunawan Edwin Kurniawan Elisabet Dela Marcela Eunike Endariahna Surbakti Farica Perdana Putri Fenina Twince Tobing Istiono, Wirawan Ivransa Zuhdi Pane Jansen Pratama Johan Setiawan Joshua Suharyadi Lionissa Ratnawati Darmawan Marcia Juvanie Chang Maria Irmina Prasetiyowati Marlinda Vasty Overbeek Mitha Anggreani Rupang Moeljono Widjaja Muhammad Dzulfiqar Ramadhan Wibawanto Natasya Yuasan Ni Made Satvika Iswari Niki Prastomo Nunik Afriliana Olivia Benazir Ester Tiwow PM Winarno Rangga Winantyo Raul Andrian Risyad Ananda Putra Syarief Gerald Prasetya Syifa Fauziyah Tirta Prawisuda Vincent Anderson Ngadiman Waworuntu, Alexander Wella Wella Yaman Khaeruzzaman

Title Search

Found 6 Documents Search Journal : Jurnal ULTIMA Computing

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title

Found 6 Documents
Search
Journal : Jurnal ULTIMA Computing