Garuda - Garba Rujukan Digital

p-Index From 2020 - 2025

1.497

P-Index

This Author published in this journals

All Journal Jurnal Ilmu Komputer dan Informasi JIKSI (Jurnal Ilmu Komputer dan Sistem Informasi) Computatio : Journal of Computer Science and Information Systems ComTech: Computer, Mathematics and Engineering Applications Jurnal Teknik Informatika (JUTIF) TIERS Information Technology Journal

Lely Hiryanto

Fakultas Teknologi Informasi Universitas Tarumanagara Jakarta - Indonesia

Author-ID : 470917

Computer Science & IT Engineering Mathematics Other

Published : 46 Documents Claim Missing Document

Claim Missing Document

Articles

1 2 3 4 5

Predicting and Analyzing the Length of Study-Time Case Study: Computer Science Students Handhayani, Teny; Hiryanto, Lely
ComTech: Computer, Mathematics and Engineering Applications Vol 8, No 2 (2017): ComTech
Publisher : Bina Nusantara University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21512/comtech.v8i2.3756

The length of study-time is one of the important issues in higher education. The goal of this research was to predict and analyze the length of studytime in the early stage of Computer Science students in X University. The research proposed Mutual Information (MI) as feature selection method and Support Vector Machine (SVM) as a classification method. There were two different sections of the experiments. The first experiment used two class targets that were grouped in ‘on time group’ and ‘late group’. The experiment result shows that the proposed method produces accuracy around 85%. The second experiment used three class targets, ‘on time group’, ‘late group’, and ‘very late group’. The experiment result of the proposed method produces accuracy around 80%. Mutual Information (MI) does not only successfully raise the accuracy but also uncovers the relationship between subjects and the class targets.

ALGORITMA KOMPRESI FRAKTAL SEQUENTIAL DAN PARALEL UNTUK KOMPRESI CITRA Lely Hiryanto; Satrya N. Ardhytia
Jurnal Ilmu Komputer dan Informasi Vol 3, No 2 (2010): Jurnal Ilmu Komputer dan Informasi (Journal of Computer Science and Information)
Publisher : Faculty of Computer Science - Universitas Indonesia

Kompresi citra adalah proses mengurangi ukuran dari citra dengan mengurangi kualitas dari citra tersebut. Metode Fraktal yang digunakan bekerja dengan mencari kemiripan pada piksel-piksel citra dan mengelompokkannya dalam beberapa cluster. Semakin tinggi tingkat kemiripan pada citra, rasio kompresi akan semakin baik. Pada citra berwarna (RGB) metode tersebut diulang sebanyak tiga kali, masing-masing untuk satu elemen warna. Hasil akhir dari proses kompresi adalah tiga virtual codebook, masing-masing untuk satu elemen warna, yang menyimpan nilai dari brightness, contrast, dan tipe transformasi affine yang digunakan untuk tiap cluster. Proses dekompresi dari metode ini adalah dengan membentuk citra kosong dengan resolusi yang sama dengan citra asli dan mengisikan nilai RGB pada tiap piksel yang bersangkutan dengan menghitung nilai yang tersimpan pada virtual codebook. Dengan menggunakan nilai Coefficient of Variation (CV) sebagai penyesuaian nilai standar deviasi dan 57 citra BMP24-bit, hasil pengujian menunjukkan rasio kompresi rata-rata sebesar 41.79%. Dengan metode paralel yang digunakan, proses kompresi citra berwarna menunjukkan rata-rata nilai speed-up sebesar 1.69 dan nilai efisiensi prosesor sebesar 56.34%. Image compression is a process of reducing the size of the image by reducing the quality of the image. Fractal method is used to work by searching for similarities in the image pixels, and group them in clusters. The higher the degree of resemblance to the image, the better the compression ratio. In the color image (RGB) the method is repeated three times, each for one color element.The end result of the compression process is a three virtual codebook, each for one color element, which stores the value of the brightness, contrast, and the type of affine transformation are used for each cluster. Decompression process of this method is to form a blank image with the same resolution with the original image and fill in the RGB values at each pixel corresponding to the count value stored in the virtual codebook.By using the Coefficient of Variation (CV) as an adjustment value and standard deviation of 57 pieces of 24-bit BMP images, test results showed an average compression ratio of 41.79%. With the parallel method is used, the compression process of color image shows the average speed-up values of 1.69 and the processor efficiency of 56.34%.

PENGEMBANGAN METODE GRAPH COLORING UNTUK UNIVERSITY COURSE TIMETABLING PROBLEM PADA FAKULTAS TEKNOLOGI INFORMASI UNIVERSITAS TARUMANAGARA Lely Hiryanto; Jacklin Sinthia Thio
Jurnal Ilmu Komputer dan Informasi Vol 4, No 2 (2011): Jurnal Ilmu Komputer dan Informasi (Journal of Computer Science and Information)
Publisher : Faculty of Computer Science - Universitas Indonesia

University Course Timetabling Problem merupakan proses penjadwalan mata kuliah di sebuah universitas yang hasilnya diusahakan seoptimal mungkin untuk tidak saling berbenturan dengan batasan-batasan dan syarat-syarat (constraints) tertentu. Dalam menentukan penjadwalan berbasis perhitungan, salah satu metode yang dapat digunakan adalah Graph Coloring. Graph Coloring merupakan merupakan metode yang paling sederhana dan dapat digunakan untuk menentukan penjadwalan yang memiliki berbagai macam constraints. Pada penelitian ini, peneliti mengusulkan pengembangan dari metode Graph Coloring yang ada untuk membuat penjadwalan mata kuliah yang optimal dengan memertimbangkan berbagai macam constraints. Pengembangan ini diujicobakan ke penjadwalan mata kuliah di Fakultas Teknologi Informasi Universitas Tarumanagara (FTI Untar). Hasil percobaan menunjukkan bahwa pengembangan metode Graph Coloring memberikan hasil penjadwalan yang memenuhi rata-rata 93% seluruh constraints yang ditentukan. Rata-rata 7% pelanggaran constraints dikarenakan keterbatasan jumlah ruang dan total slot waktu kuliah, serta permintaan jadwal tertentu oleh dosen. University Course timetabling problem is the process of scheduling courses at a university whose results are optimally arranged to not collide with the limits and conditions (constraints) specified. In determining the scheduling komputatif, one method that can be used is the Graph Coloring. Graph Coloring is the simplest method and can be used to determine which have a variety of scheduling constraints. In the present study, the researcher proposes the development of the existing methods of Graph Coloring to make optimal scheduling of courses taking into account various constraints. This development was tested to the scheduling of courses in the Faculty of Information Technology University Tarumanagara (FTI Untar). The experimental results show that the development of methods of Graph Coloring deliver results that meet the scheduling of an average 93% of all the specified constraints. Average of 7% violation constraints due to limitations of space and the total number of time slots in college, and request a specific schedule by the lecturer.

PERBANDINGAN PENERAPAN METODE FREQUENT PATTERN TREE DENGAN METODE SQL BASED PATTERN MINING PADA SISTEM PENYIMPANAN DAFTAR PESERTA MATA KULIAH FAKULTAS TEKNOLOGI INFORMASI UNIVERSITAS TARUMANAGARA Gabriel Fransisco; Lely Hiryanto
Jurnal Ilmu Komputer dan Sistem Informasi Vol 3, No 1 (2015): Jurnal Ilmu Komputer dan Sistem Informasi
Publisher : Fakultas Teknologi Informasi Universitas Tarumanagara

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24912/jiksi.v3i1.3269

The system created to compare the most efficient method among Frequent Pattern Tree method, SQL Based Pattern Mining method and conventional data storage for storing List of Participants Course (DPMK) Information Technology Faculty of Tarumanagara University (FTI Untar). Frequent Pattern Tree method is a method that forming a pattern of courses taken by students using a tree structure. Based Pattern Mining SQL method is a method that forming a pattern of courses by combining the data DPMK becomes a itemsets and take advantage of the features found on the Structured Query Language (SQL) to improve its performance. Conventional data storage is storing DPMK without forming a pattern of courses. The results of the three storage methods are used to form Student Attendance List report and Student Study Cards report. The results show SQL-Based Pattern Mining method is the most efficient method when viewed from the data needed to store and the length of upload time compared to Frequent Pattern Tree method and conventional data storage. However the data call duration used in forming Student Attendance List report and Student Study Cards report using conventional data storage method are faster than method that use a pattern of courses. Key wordsDafta Peserta Mata Kuliah, Frequent Itemset, Frequent Pattern Mining, Frequent Pattern Tree, SQL Based Pattern Mining

IMPLEMENTASI VERTEX GRAPH COLOURING, PARTICLE SWARM OPTIMIZATION, DAN CONSTRAINT BASED REASONING UNTUK UNIVERSITY TIMETABLING PROBLEM (STUDI KASUS: FTI UNTAR) Josselyn Sinthia Thio; Lely Hiryanto
Jurnal Ilmu Komputer dan Sistem Informasi Vol 1, No 1 (2013): Jurnal Ilmu Komputer dan Sistem Informasi
Publisher : Fakultas Teknologi Informasi Universitas Tarumanagara

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24912/jiksi.v1i1.3078

An application of exams and courses scheduling is made using Vertex Graph Colouring, Particle Swarm Optimization, and Constraint Based Reasoning method to produce a valid and optimal exam and course schedule which can also fulfill the demands of special schedule and room needs. FTI Untar is used as a study case in this development. The results of the tests done for the courses scheduling of even semester of 2010 / 2011 till odd semester of 2012 / 2013, without collision of special preferences, show that on average there’s no hard-constraints (constraints that must be satisfied) violation, only 13% of soft-constraints (constaints that are attempted to be satisfied) violations between each course and 6% soft-constraints violation due to the poor preference score of the room or time used. Whilst, the results of the tests done for the exams scheduling of odd semester of 2011 / 2012 and 2012 / 2013 show that on average there’s no hard-constraint and soft-constraint violation between each course although there is still 1% soft-constraints violation due to the poor preference score of the room used. The development was tested to the Secretariat of Informatics Department in FTI Untar and obtain a positive response because of the user-friendly user interfaces and can help to accelerate the process of course, practicum, and exam schedule’s report making.

Perancangan Aplikasi Container Loading Problem dengan Menggunakan Maximal Space Algorithm Rosalinda Rosalinda; Lely Hiryanto; Gunadi Gan
Jurnal Ilmu Komputer dan Sistem Informasi Vol 1, No 1 (2013): Jurnal Ilmu Komputer dan Sistem Informasi
Publisher : Fakultas Teknologi Informasi Universitas Tarumanagara

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24912/jiksi.v1i1.3088

This paper presentmaximalspace algorithmtosolve the problem ofloadingcargointo containers.This algorithmis presentedin two phases, that isconstructive phasesandimprovementphases. With constructivephase, optimal resultsareobtainedin the use ofphaseimprovement.The result of this experiment is the objection objective of this application has been achieved. It’s because the data testing can load cargo to container successfully. However, the size of each cargo can affect the rest of the container volume.

PENGUMUMAN ONLINE DENGAN NOTIFICATION SYSTEM DAN PENCARIAN INFORMASI MENGGUNAKAN METODE TF-IDF Chintia Yusnita Violetta; Lely Hiryanto; Bagus Mulyawan
Jurnal Ilmu Komputer dan Sistem Informasi Vol 2, No 1 (2014): Jurnal Ilmu Komputer dan Sistem Informasi
Publisher : Fakultas Teknologi Informasi Universitas Tarumanagara

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24912/jiksi.v2i1.3167

Application Announcement Online with Search Information Notification System and method TF-IDF is an application that uses the notification system on email, facebook group, twitter to help convey information related to teaching and learning in the Faculty of Information Technology University Tarumanagara. In addition, there is information search function to find information relevant to a query by using the TF-IDF algorithm. Based on test results, notifications on email, facebook group, twitter managed to send the announcement via their respective social media. Testing information search data can also provide information relevant results to the query. Key WordsNotification System, Online Announcement, TF-IDF.

SISTEM PENAWARAN DAN PENJADWALAN MATA KULIAH DENGAN METODE K-MEDOIDS DAN PENDEKATAN ALTERNATIF GRAPH COLORING Mishelle Tirtajaya Winartha; Lely Hiryanto
Jurnal Ilmu Komputer dan Sistem Informasi Vol 2, No 1 (2014): Jurnal Ilmu Komputer dan Sistem Informasi
Publisher : Fakultas Teknologi Informasi Universitas Tarumanagara

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24912/jiksi.v2i1.3177

Class offers and scheduling application is made by using k-medoids and alternative graph coloring approach. This application optimizes the offers of class scheduling. The sample case is Faculty of Information Technology at Tarumanagara University. k-Medoids is used to acquire the number of classes that need to be offered on new semester and alternative graph coloring approach is used to acquire the class that has been adjusted with lecturer’s time and room availability. The results still indicate the violation of soft constraint. The most frequent violation of soft constraint is the mismatch schedule to lecturer’s time availability. Key wordsAlternative Graph Coloring Approach, Fakultas Teknologi Informasi Universitas Tarumanagara, k-Medoids, University Course Timetabling Problem

PREDIKSI KELULUSAN MAHASISWA MENGGUNAKAN ALGORITMA DECISION TREE C4.5 DENGAN TEKNIK PRUNING Isa Iskandar; Lely Hiryanto; Janson Hendryli
Jurnal Ilmu Komputer dan Sistem Informasi Vol 6, No 1 (2018): JURNAL ILMU KOMPUTER DAN SISTEM INFORMASI
Publisher : Fakultas Teknologi Informasi Universitas Tarumanagara

The system created are used to predict the length of study period required for students to complete their studies based on their grades. The system created also have online consultation features that students use with their academic lecturer for academic consultations. To find the model tree with good accuracy, the system will use k-fold cross validation in the process of making model tree. Testing prediction system using students data from 2008 to 2012 who have completed their studies. The value data used is all mandatory courses in the Faculty of Information Technology except for thesis courses. Based on the tests performed, the system can already run and used in accordance with the design made. The test is to compare the accuracy of the selected tree model from different k values in the k-fold cross validation process. The results obtained show that if the value of k the greater, then the accuracy obtained better.

APLIKASI ONLINE KUESIONER, FORUM, VOTING DAN VOTING ON SITE DENGAN MENGGUNAKAN FINGERPINT ORGANISASI MAHASISWA FTI UNIVERSITAS TARUMANAGARA Hans Kristianto; Lely Hiryanto
Jurnal Ilmu Komputer dan Sistem Informasi Vol 3, No 2 (2015): Jurnal Ilmu Komputer dan Sistem Informasi
Publisher : Fakultas Teknologi Informasi Universitas Tarumanagara

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24912/jiksi.v3i2.3312

Aplikasi online kuesioner, forum, dan voting merupakan aplikasi yang dibuat untuk mengatasi permasalahan dalam mendapatkan partisipasi mahasiswa. Untuk Voting dibagi menjadi dua, yaitu voting online dan voting on site. Pada voting on site menggunakan autentikasi fingerprint dan dalam pertukaran datanya menggunakan method POST dan dalam pertukaran datanya berformat JSON. Aplikasi ini akan menghasilkan keikutsertaan atau partisipasi mahasiswa yang meningkat terhadap kegiatan organisasi mahasiswa Fakultas Teknologi Informasi Universitas Tarumanagara yang optimal. Studi kasus yang digunakan dalam aplikasi adalah organisasi mahasiswa Fakultas Teknologi Informasi Universitas Tarumanagara. Hasil pengujian aplikasi ini adalah banyaknya mahasiswa yang menyetujui dengan adanya penggunaan aplikasi ini karena dipermudahkannya mahasiswa dalam mengikuti kegiatan-kegitan yang organisasi mahasiswa lakukan.. Key wordsFingerprint, Organization, Voting Online, Forum Online, Kuesioner Online, Voting On Site user Fingerprint, Partisipasi

Co-Authors Alfine Candra Cuaca Anak Agung Gede Sugianthara Andre Widjaya Andri Firnandius Andri Muliawan Ardhytia Satria Nugraha Arnold Pramudita Tjiawi Aurelia bagus Mulyawan Bagus Mulyawan Bobby Tumbelaka Bobby Tumbelaka Brando Dharma Saputra Chairisni Lubis Chandra Wijaya Chandra Wijaya Chandra Wijaya Chintia Yusnita Violetta Darius Andana Haris Dedi Trisnawarman Desi Arisandi Dian Anggraini Cahyaningtyas Dya Erny Herwindiati Dyah Erny Herwindiati Dyah Erny Herwindiati Elizabeth Erlsha Elizabeth Erlsha, Elizabeth Ericko Satyagraha Ericko Satyagraha Farenco Farenco Farenco Farenco Ferryanto Ferryanto Ferryanto Ferryanto Fika Alfiani Frankie Frankie Frankie Frankie, Frankie Fransisca Regina Fransisca Regina, Fransisca Gabriel Fransisco Gabriel Fransisco, Gabriel Grimaldi Suryadi Grimaldi Suryadi Gunadi Gan Gunadi Gan Harprori Patti Irawati Djajadi Irawati Djajadi Isa Iskandar Jacklin Sinthia Thio James Ariel Gunawan James Ariel Gunawan, James Ariel Janson Hendryli Jason Djatmiko Josselyn Sinthia Thio Karendef Karendef Kristianto, Hans Kurniawan Sulianto Lee, Viciano Lina Lina Listovie Cavito Mariana - Mariana Mariana Martono Darsono Martono Darsono Mishelle Tirtajaya Winartha Nadia Yanitra Nadya Yanitra, Nadya Pharadya Ajeng Swari Sukmawati Ratchagit, Manlika Renaldo Ali Renaldo Ali, Renaldo Riki Yohanes Hendriyanto Rionaldy Trisaputra Rosalinda . Rosalinda Rosalinda Satrya N. Ardhytia Stephanie Budianto Stephen Yan Putra Halim, Stephen Yan Putra Stevy Lie Stevy Lie, Stevy Sufisan Sufisan TATI NURHAYATI Teny Handhayani Timothy Reynaldi Tony Tony Tony Tony TRI SUTRISNO Vina Tandean Viny Christanti M Wirawan, Andhika Putra Yunita Yunita Yunita Yunita

Title

Found 46 Documents
Search

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title Search

Found 46 Documents Search

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title

Found 46 Documents
Search