Articles
19 Documents
Search results for
, issue
"Vol. 3 No. 2 (2015)"
:
19 Documents
clear
<![CDATA[PENGEMBANGAN APLIKASI ENCODING DAN DECODING TREE MENGGUNAKAN KODE DANDELION ]]>
<![CDATA[Wamiliana Wamiliana]]>;
<![CDATA[Astria Hijriani]]>;
<![CDATA[Novi Hardiansyah]]>
<![CDATA[ Jurnal Komputasi Vol. 3 No. 2 (2015) ]]>
Publisher : <![CDATA[Jurusan Ilmu Komputer Fakultas MIPA Universitas Lampung ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.23960/komputasi.v3i2.1113
<![CDATA[In this research, we develop The Application of Encoding and Decoding Tree Using The Dandelion Code. It aims to obtain Dandelion code of a tree using encoding and decoding. The encoding generates code from a tree, and decoding processes a code back into a tree. This application is developed to produce the best tree representation. Additionally, in this research we give an example of problem that can use Dandelion Code for solving the lowest cost for electricity installation.Keywords : Application, Encoding, Dandelion Code, Decoding, Tree, Tree Representation.]]>
<![CDATA[Kajian Algoritma Modul Pencetakan Pembimbing Akademik Jurusan Ilmu Komputer ]]>
<![CDATA[Dwi Sakethi]]>;
<![CDATA[Didik Kurniawan]]>;
<![CDATA[Choiranti Efrina]]>
<![CDATA[ Jurnal Komputasi Vol. 3 No. 2 (2015) ]]>
Publisher : <![CDATA[Jurusan Ilmu Komputer Fakultas MIPA Universitas Lampung ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.23960/komputasi.v3i2.1121
<![CDATA[The list of academic advisor utility is an utility that was developed to help the administration process of computer science major. Previously, it's only used bubble sort sorting algorithm. We try to compare the bubble sort algorithm with selection sort and quick sort to determine the quickest algorithm which will be implemented in other major by searching the worst case (slowest execution time per unit) and best case (fastest execution time per unit). The result is quick < selection < bubble. Selection sort algorithm is proven to be the quickest when n < 26. But the cademic advisor data that are used in the utility is more than 26. So in this research, the quicksort algorithm is the fastest algorithm.  ]]>
<![CDATA[IMPLEMENTASI STEGANOGRAFI UNTUK MENYISIPKAN PESAN TEKS PADA MEDIA GAMBAR DENGAN METODE END OF FILE ]]>
<![CDATA[Wamiliana Wamiliana]]>;
<![CDATA[Astria Hijriani]]>;
<![CDATA[Azharico Darusman]]>
<![CDATA[ Jurnal Komputasi Vol. 3 No. 2 (2015) ]]>
Publisher : <![CDATA[Jurusan Ilmu Komputer Fakultas MIPA Universitas Lampung ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.23960/komputasi.v3i2.1127
<![CDATA[Security and confidentiality of data transmission are two important aspects in the era of openness to data access and information. One way to secure the data transmission is using steganography. In this research, the method used is End Of File (EOF) and used image as the medium. The message is hidden by inserting it in the end of the line image file. The media for hiding the message is in the form of .jpg and the output is in the form of .png. Inputting message is done manually. Testing have been conducted on 5 types of images with different resolutions with a number of different messages characters which are 10, 100, and 1000 characters. The results show that the method of End Of File (EOF) successfully used to hide message in the media image and to take back the message that has been inserted. The image size and the number of characters used affects the processing time for embedding and extracting. Cropping, contrasting, and brightness on stego image are conducted to analyze the resilience of the message inserted. The results show that the stego image manipulations are sensitive or resistant to the manipulation that makes the message becomes corrupted and are not recommended in manipulating stego image.Keywords : embed, End Of File (EOF), extract, image, steganography, stego Image]]>
<![CDATA[Penyederhanaan Tata Bahasa Bebas Konteks Dalam Bentuk Normal Chomsky Menggunakan PHP ]]>
<![CDATA[Rico Andrian]]>;
<![CDATA[Wamiliana Wamiliana]]>;
<![CDATA[Ismail Indra Pratama]]>
<![CDATA[ Jurnal Komputasi Vol. 3 No. 2 (2015) ]]>
Publisher : <![CDATA[Jurusan Ilmu Komputer Fakultas MIPA Universitas Lampung ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.23960/komputasi.v3i2.1129
<![CDATA[In this research we develop an application to simplify context-free grammar into a Chomsky normal form. This software was made to complete the process of simplification of the context-free grammar (CFG) so that user can identify the stages of a process of simplification, easy to understand the simplification at any stages as well as speed up the process. This software is created using the PHP programming language and use context-free grammar (CFG) as the input. The process order is carried out starting from removing epsilon, unit, and useless production so that the result is in Chomsky Normal Form. Black Box testing results with the method of partitioning software equivalen suggests that simplification of software context-free grammar into a Chomsky normal form using PHP was successful and suitable with the user needs.]]>
<![CDATA[Sistem Informasi Kuliah Kerja Nyata (KKN) Dengan Metode Pigeon Hole Untuk Menentukan dan Mengelompokkan Peserta KKN ]]>
<![CDATA[Aristoteles .]]>;
<![CDATA[Rico Andrian]]>;
<![CDATA[Agatha Beny Himawan]]>
<![CDATA[ Jurnal Komputasi Vol. 3 No. 2 (2015) ]]>
Publisher : <![CDATA[Jurusan Ilmu Komputer Fakultas MIPA Universitas Lampung ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.23960/komputasi.v3i2.1131
<![CDATA[This research is conduct to make a system called “Information System of KKN with Pigeon Hole Method for Determine and Grouping KKN Participantâ€. Grouping KKN participant based on gender and major of faculty. Grouping KKN participant based on gender is every KKN group consist of 7 participant that consist of 3 male and 4 female. Grouping KKN participant based on majority and faculty is every KKN group consist of 7 participant that consist max 2 participant from same major and max 3 participant from same faculty. The result of grouping KKN participants based on each assumptions is percentage of system accuracy in classifying participant KKN is not much different from the ideal of percentage each group data. This information system of KKN is make using prototype method which is part of SDLC. Information system of KKN can be use as a means by students to participate KKN process. Information system of KKN with pigeon hole method make placement and grouping KKN participant more easy and well ordered.Keywords: KKN, Pigeon Hole, Prototype, System Development Life Cycle]]>
<![CDATA[APLIKASI PENGUBAH BENTUK NORMAL CHOMSKY MENJADI BENTUK NORMAL GREIBACH DENGAN METODE SUBSTITUSI ]]>
<![CDATA[Rico Andrian]]>;
<![CDATA[Wamiliana .]]>;
<![CDATA[Andikha Yunar Cornelius Dabukke]]>
<![CDATA[ Jurnal Komputasi Vol. 3 No. 2 (2015) ]]>
Publisher : <![CDATA[Jurusan Ilmu Komputer Fakultas MIPA Universitas Lampung ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.23960/komputasi.v3i2.1132
<![CDATA[The research was conducted with making an application to change Chomsky Normal Form (CNF) to Greibach Normal Form (GNF) with substitution method. One way of representing Context Free Grammar (CFG) is using Greibach Normal Form (GNF). The development of the application starts by making algorithm with prototype method to change Chomksy Normal Form (CNF) to Greibach Normal Form (GNF). This application is used to change Chomsky Normal Form to Greibach Normal Form and the results show that the application can change Chomsky Normal Form to Greibach Normal Form smoothly.The input for the application must be on Chomksy Normal Form (CNF). Keywords: Chomsky Normal Form, Context Free Grammar, Greibach Normal Form, Prototype Method ]]>
<![CDATA[APLIKASI PENYEDERHANAAN CONTEXT FREE GRAMMAR ]]>
<![CDATA[Rico Andrian]]>;
<![CDATA[Wamiliana .]]>;
<![CDATA[Andriyan Hutomo]]>
<![CDATA[ Jurnal Komputasi Vol. 3 No. 2 (2015) ]]>
Publisher : <![CDATA[Jurusan Ilmu Komputer Fakultas MIPA Universitas Lampung ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.23960/komputasi.v3i2.1133
<![CDATA[This research is done by making an application to simplify Context Free Grammar (CFG). The process of making the application starts from designing the algorithm using eXtreme Programming method as system development methods until get the application to simplify Context Free Grammar (CFG). The testing method to test the application is Black Box Testing. The result shows that the application can simplify Context Free Grammar smoothly, and how to simplify Context Free Grammar step by step. Context Free Grammar (CFG) simplification has three stages, eliminating espsilon production, eliminating unit production and eliminating useless production, those three stages must be done sequentially. Keywords: Chomsky Normal Form, Context Free Grammar, Greibach Normal Form, Prototype Method ]]>
<![CDATA[PENGEMBANGAN SISTEM INFORMASI PENDAFTARAN BEASISWA PENINGKATAN PRESTASI AKADEMIK (PPA) JURUSAN ILMU KOMPUTER FAKULTAS MATEMATIKA DAN ILMU PENGETAHUAN ALAM UNIVERSITAS LAMPUNG DENGAN MENERAPKAN ALGORITMA SORTING QUICK SORT DAN SELECTION SORT ]]>
<![CDATA[Dwi Sakethi]]>;
<![CDATA[Febi Eka Febriansyah]]>;
<![CDATA[Novita Sari]]>
<![CDATA[ Jurnal Komputasi Vol. 3 No. 2 (2015) ]]>
Publisher : <![CDATA[Jurusan Ilmu Komputer Fakultas MIPA Universitas Lampung ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.23960/komputasi.v3i2.1134
<![CDATA[Information System of PPA Scholarship Registration at Department of Computer Science Faculty of Mathematic and Natural Science Universitas Lampung by applying Sorting Algorithm Quick Sort and Selection Sort is a system that is used to ease the processing of shcolarship data. A student who participates the selection of PPA scholarship registration at Department of Computer Science has to enter the registration data on this system, so that the Secretary of Department doesn’t need to enter the applicant’s scholarship registration data anymore. This system can also rank automatically by using two sorting methods Quick Sort and Selection Sort. This system is built by using PHP as the programming languange and MySQL. Based on running time sort and complexity of its algorithm, it’s proved that Quick Sort Method is faster that Selection Sort Method. The result of functional testing data shows that the system can function in accordance with the requirement analysis. Based on non-fuctional testing data, it shows that at admin level of this system is include in category of “Good†with the average value of 4.20 and user (student) level of this system is include in category of “Good†with the average value of 3.97.]]>
<![CDATA[PENGEMBANGAN MODUL PENERIMAAN KARYAWAN DAN MODUL PENGGAJIAN PADA SISTEM INFORMASI KEPEGAWAIAN PT. TRAKTOR NUSANTARA BANDAR LAMPUNG ]]>
<![CDATA[Astria Hijriani]]>;
<![CDATA[Febi Eka Febriansyah]]>;
<![CDATA[Ana Ana]]>
<![CDATA[ Jurnal Komputasi Vol. 3 No. 2 (2015) ]]>
Publisher : <![CDATA[Jurusan Ilmu Komputer Fakultas MIPA Universitas Lampung ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.23960/komputasi.v3i2.1135
<![CDATA[This study developed a Decision Support System (DSS) by utilizing Analytical Hierarchy Process (AHP) Method as a process in selection of employees acquisition. This selection process used several criteria (multicriteria) to choose which applicants will be accepted. This Decision Support System (DSS) helps managers of Human Resources (HR) in deciding which applicants will be selected. In this application, there are criteria used and the weight of those criteria. This application of module business process will be able to generate the rank of each applicant based on the final amount. The applicant who has the greatest value will be given a better rank and it means that the applicant has criteria in accordance with company’s requirement. In addition, Web Service as a business process of payroll modules. In this process, a set of functions or methods which contained on a server can exchange data and information using an operating system and application that different from each other through the internet that uses XML as the format of message delivery. This system constructed by using PHP and MySQL as language. The result of functional testing data based on test case testing shows that the system can work "in accordance" with its analysis.]]>
<![CDATA[PENGEMBANGAN SISTEM INFORMASI JOB RECORD DAN PENILAIAN KINERJA KARYAWAN PADA PT. TRAKTOR NUSANTARA BANDAR LAMPUNG ]]>
<![CDATA[Astria Hijriani]]>;
<![CDATA[febi eka febriansyah]]>;
<![CDATA[fitriana rahmawati]]>
<![CDATA[ Jurnal Komputasi Vol. 3 No. 2 (2015) ]]>
Publisher : <![CDATA[Jurusan Ilmu Komputer Fakultas MIPA Universitas Lampung ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.23960/komputasi.v3i2.1136
<![CDATA[Job Record is the reference of Worker Performance Appraisal process where maximum or not the performance worker on certain period will be determined. The Development of Job record and worker performance appraisal information system with apply XML web service as method to exchange information between one and the other domains. With Web Service into information system could be handle business process that is recruitment, job record, worker performance appraisal, and payroll system. The resulting of exchange the information that is information of employees, overtime, and incentive. The implemented of this information system using PHP  programming language and MySQL database and web service method using XML programming language. The result of Black Box testing showed that this The development of Job record and worker performance appraisal information system has been successfully created as the users need.]]>
