Theresia Herlina R.
Universitas Kristen Duta Wacana

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

IMPLEMENTASI METODE USER CENTERED DESIGN DALAM PERANCANGAN APLIKASI PEMBELAJARAN VLAN & INTER-VLAN ROUTING Anthonio Febrianto Patulak; Joko Purwadi; Theresia Herlina R.
Jurnal Informatika Vol 11, No 1 (2015): Jurnal Teknologi Komputer dan Informatika
Publisher : Universitas Kristen Duta Wacana

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (5179.41 KB) | DOI: 10.21460/inf.2015.111.428

Abstract

This research aims to make learning application materials VLANs and Inter-VLAN Routing with User-Centered Design (UCD) methods. System was evaluated by involving students, to evaluate the level of interest and ease students' learning. The results of feedback given by the participants back to the interface implemented learning applications. In addition, the authors also do a hypothesis test to determine whether the designed application has improved the understanding of learning for the user or not. Based on the results of usability testing using self-reported metrics showed 72% of participants agreed that the learning system useful, 74% of participants were satisfied with the learning system that has been made, 62% of participants agreed that the learning system is easy to use, and 64% of participants agreed that the learning system provides ease of learning.
PERBANDINGAN ALGORITMA SHORTEST PATH DALAM PEMROSESAN CITRA DIGITAL SEAM CARVING Florentinus Alvin Sebastian; R. Gunawan Santosa; Theresia Herlina R.
Jurnal Informatika Vol 11, No 2 (2015): Jurnal Teknologi Komputer dan Informatika
Publisher : Universitas Kristen Duta Wacana

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (479.51 KB) | DOI: 10.21460/inf.2015.112.449

Abstract

Seam carving is a method of content aware image resizing. As solutions shortest path algorithms are used to find images seams. Seam is a horizontal or vertical path of an image that has minimum energy. There are two (2) shortest path algorithms that will be discussed in this paper. This paper contains the results of shortest path algorithms comparison between Dijkstra and Directed Acyclic Graph to see which one is better than another in case of efficiency. The precomputed and recomputed methods will be compared to find the more efficient method for executing the seam carving transformation. A web application has been built for this purpose. This web app is capable of transforming image size with seam carving method. The complexity of Dijkstra and Acyclic will be compared to find which one is better. The result is Dijkstra has been won, with the O(4V) with Acyclicis O(5V). The use of precomputed and recomputed is evaluated by the conditions. If the preparation is evaluated then recomputed is more efficient, but if the preparation is not evaluated then the precomputed method is the better one and has faster performance.