Search

Indonesia has a variety of local languages, which is the Batak Toba language. This time, there are still some Batak Toba people who do not know speak Batak Toba language fluently. Nowadays, desktop based dictionary is one of reference that very efficiently used to learn a language and also to increase vocabulary. In making the dictionary application, string matching can be implemented for word-searching process. String matching have some algorithm, which is Berry – Ravindran algorithm and Zhu-Takaoka algorithm and will be implemented on the dictionary application. Zhu-Takaoka algorithm and Berry – Ravindran algorithm have two phases, which are the preprocessing phase and the searching phase. Preprocessing phase is a process to make the shifting values according to in pattern that input by user. To know the shifting value with Zhu-Takaoka algorithm, it’s need Zhu-Takaoka Bad Character (Ztbc) and Boyer-Moore Good Suffix (Bmgs). Then, Ztbc will be compared to Bmgs to get the maximum value of them that will be set as shifting value. While Berry-Ravindran algorithm, to know the shifting value is needed Berry-Ravindran Bad Character, which the two characters right of the text at the position m + 1 and m+ 2, is needed to determine the shifting value, where m is length of the pattern.

Steganography technique is a technique to hide data or information into other media such as digital images, text, sound, or video. One of the simplest methods of Steganography in the concept of Steganography is the Least Significant Bit. The Least Significant Bit (LSB) method hides the message by inserting the message at the lower or rightmost bits in the cover work file as a medium to hide the message. Caesar Cipher is one method that replaces each letter in the plaintext with letters that are at odds with certain numbers in the alphabet. Columnar transposition Cipher is one method in which messages are written in rows of a specified length, then are read column by column in the order of reading based on a keyword. The message is inserted into the cover image with the target pixel determination to be inserted based on the results of the Caesar Cipher process of the Columnar Transposition Cipher index to the random value of the Multiply With Carry Generator algorithm. The system implementation uses the C# programming language. The results of this study indicate that the implementation of a combination of Caesar Cipher, Columnar Transposition Cipher, and Multiply With Carry Generator can maintain the confidentiality, integrity, and security of data.

We present a client-server based smartphone application that act as a music input device with several outputs. The application allows user to interact with one phone as the input and the server and hear the sound from several connected smartphones that act as clients. Since transmitting data may require some time, we need to deal with transmission delay. Hence, we developed an algorithm to detect the delay and synchronize these values between all connected devices. By agreeing to a single delay value, we were able to minimize the difference in playtime between server and connected clients. We performed the test by building an Android-based smartphone application, installing it to multiple devices, and connecting them to a WiFi-based local area network. The test shows that our proposed system has successfully reduce the difference between devices and the connected devices were able to produce sounds with insignificant delay.

The current modern smartphones have been equipped with multiple sensors to add the functionality of the phones. Two of the most significant sensors, accelerometer and gyroscope, are intended to sense the movement and orientation of the phone. We performed research to evaluate the capability of these two sensors to detect a road’s quality, which can be used to generate a map of road quality in a certain area. The research is done by placing the mobile phone in a flat area inside the car and ride the car through roads with various quality, especially the damaged ones. We collected the value of both sensors when passing through hollow, bumpy, and cracked roads with several variations of speed. Based on our test, we conclude that this method is not effective in detecting the quality of the road since it is hard to differentiate the data from other behaviours such as accelerating, braking, turning, or even the car vibration. In this paper, we present the method used to perform this research and the collected data that may help our conclusion.

The availability of various string-matching algorithm raises the concern of finding the one with the best performance. With the growth of digital content, especially a text-based content, using an optimal algorithm is crucial to decrease the cost of performing a task. There are numerous studies using a specific content to evaluate the performance of ones algorithm. In this paper, we chose two commonly used string-matching algorithm; Reverse Colussi and Raita and compare the performance of these algorithm in finding text in Indonesian language. We specifically use Indonesian songs lyrics as our samples. To perform the test, we build and text-based song finder Android application. Our test result shows that Raita outperformed Reverse Colussi in most of the cases. This finding is due to the requirement of Reverse Colusi algoritm to have pre-processing step before performing the search.

Rendering a complex global illumination scene requires an extensive computational resource. It is hard to achieve a real time rendering of a complex object using explicit 3D information. To tackle this obstacle, many techniques have been introduced to close the gap between complex 3D scene and real time rendering. One of the proposed solutions is using an image-based rendering technique. Image-based rendering is a method to achieve the desired image by referencing the sampled image as a source. This thesis will focus on a mix between image-based rendering and geometrybased rendering. Instead of rendering directly using a global illumination method, we use a set of image, which are captured during the offline rendering. We call the firstprocess as light transport pre-calculation process. These images then treated as a texture and will be attached to the polygon during the online rendering process. Based on the viewer position, the system decides which value to attach on the polygon. This rendering process however requires a lot of calculation. Luckily, recent graphic card allows developer to exploit GPU‟s hardware by making it possible to reprogram the rendering pipeline. As a graphic dedicated hardware, GPU has a lot of advantage to do a rendering compared to CPU. For example its nature of parallel processing is an advantage considering most of rendering process is a parallel processing. Other than splitting the computational task, we also would like to see how we can use the availability of memory. This can be done by processing the scene before the rendering process took place. This thesis will discuss and implement how to split the burden of processing power by rendering a pre-calculated data for later render. Since the pre-rendered data could be huge, it is also important to discuss a compression method that can be applied in GPU architecture and fast enough to be rendered as a real time. Keywords: Pre-computed Surface Radiance Transfer, Global Illumination, BRDF, Image Based Modeling and Rendering, Real Time Rendering, GPU Programming, GLSL.