cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
-
Contact Email
-
Phone
-
Journal Mail Official
-
Editorial Address
-
Location
Kota bandar lampung,
Lampung
INDONESIA
Jurnal Komputasi
Published by Universitas Lampung
ISSN : -     EISSN : -     DOI : -
Core Subject : Science,
Computer Science & IT
Lingkup dan fokus jurnal berkaitan dengan tema-tema computer science, information technology, information system, software engineering, data mining, artificial intelligence, networking, multimedia, database, dan operating system
Arjuna Subject : -
Articles 19 Documents
 1   2 
Search results for , issue "Vol 3, No 2 (2015)" : 19 Documents clear
PENGEMBANGAN SISTEM INFORMASI JOB RECORD DAN PENILAIAN KINERJA KARYAWAN PADA PT. TRAKTOR NUSANTARA BANDAR LAMPUNG Astria Hijriani; febi eka febriansyah; fitriana rahmawati
Jurnal Komputasi Vol 3, No 2 (2015)
Publisher : Universitas Lampung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.23960/komputasi.v3i2.1136

Abstract

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.
Sistem Informasi Kuliah Kerja Nyata (KKN) Dengan Metode Pigeon Hole Untuk Menentukan dan Mengelompokkan Peserta KKN Aristoteles .; Rico Andrian; Agatha Beny Himawan
Jurnal Komputasi Vol 3, No 2 (2015)
Publisher : Universitas Lampung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.23960/komputasi.v3i2.1131

Abstract

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
Rancang Bangun Aplikasi Agen Pulsa Elektronik Bebasis Android (Studi Kasus Distributor Pulsa Maxrefil) Kurniawan, Didik; Hijriani, Astria; Hartawan, Ferdi Tanza
Jurnal Komputasi Vol 3, No 2 (2015)
Publisher : Universitas Lampung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.23960/komputasi.v3i2.1149

Abstract

Build t
SISTEM PENDUKUNG KEPUTUSAN PEMILIHAN DOSEN BERPRESTASI MENGGUNAKAN METODE SIMPLE ADDITIVE WEIGHTING DI LINGKUNGAN UNIVERSITAS LAMPUNG Kurniawan, Didik; Wamiliana, Wamiliana; Aditya, Rizqi Chandra
Jurnal Komputasi Vol 3, No 2 (2015)
Publisher : Universitas Lampung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.23960/komputasi.v3i2.1137

Abstract

The selection of good achievement lecturers is a recognition for those lecturers who already had been conducting three principles of higher education with very good results. The selection of those lecturers in The University of Lampung is conducted annually. In the process of selection, the university will appoint assessing team to conduct assessments to the candidates. However, this assessment process is still conducted manually so that it will take a time to process the data. In addition, the assessment is still subjective in nature and is not yet relevant to the real conditions. Based on this background, the objective of this research was to build a decision support system to use in conducting selection process of good achievement lecturers in The University of Lampung. This decision support system was built based on web by using PHP programming language and MySQL as database, and Simple Additive Weighting method for making the decision. This method was used to determine point values of each criterion, and then ranked score was made to determine the best solution. The testing of the application using black box showed that this system was able to run properly. The results also influence the academic atmosphere and institutional quality. Keywords: decision support system, selection of good achievement lecturers , simple additive weighting
APLIKASI PENGUBAH BENTUK NORMAL CHOMSKY MENJADI BENTUK NORMAL GREIBACH DENGAN METODE SUBSTITUSI Rico Andrian; Wamiliana .; Andikha Yunar Cornelius Dabukke
Jurnal Komputasi Vol 3, No 2 (2015)
Publisher : Universitas Lampung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.23960/komputasi.v3i2.1132

Abstract

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 
PENGEMBANGAN UTILITY PENCETAKAN DAFTAR HADIR KULIAH JURUSAN ILMU KOMPUTER FAKULTAS MATEMATIKA DAN ILMU PENGETAHUAN ALAM UNIVERSITAS LAMPUNG Dwi Sakethi; Anie Rose Irawati; Aqillah Aliffah Kadir
Jurnal Komputasi Vol 3, No 2 (2015)
Publisher : Universitas Lampung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.23960/komputasi.v3i2.1150

Abstract

In 2013, the research developed a Printing Utility Lecture’s Attendance using web base of Sistem Matahari. But, due to changes in database and language of SIAKAD (Academic System Information)  University of Lampung in 2014, then the utility cannot be reused. To solving the problem, this research had successfully developed a Printing Utility of Lecture’s Attendance List, case study of Development of Computer Science, FMIPA University of Lampung. The making of attendance list is using data source from result from imported excel file format DNK (List of Student Name in A Class) retrieved from SIAKAD University of Lampung. The development is also done on improving attendance list printout with the output of a dynamic PDF file that is can be customized to user requirements.Keyword: Utility, Excel to Database, Lecture’s Attendance List
PENGEMBANGAN APLIKASI ENCODING DAN DECODING TREE MENGGUNAKAN KODE DANDELION Wamiliana Wamiliana; Astria Hijriani; Novi Hardiansyah
Jurnal Komputasi Vol 3, No 2 (2015)
Publisher : Universitas Lampung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.23960/komputasi.v3i2.1113

Abstract

Performance evaluation of Genetic Algorithm (GA) with Repairing Strategy on Knapsack Problem Aristoteles Aristoteles; Wardiyanto Wardiyanto; Aryanti Dwiastuti
Jurnal Komputasi Vol 3, No 2 (2015)
Publisher : Universitas Lampung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.23960/komputasi.v3i2.1138

Abstract

Knapsack Problem (KP) is known as one of combinatorial optimization problem that maximizes the amount of value (profit/ priority) of some of the items chosen to put in a sack or a bag without exceeding its capacity. KP has been applied in many fields: cargo loading, budget control, financial management and etc. In addition, KP is also included in NP-Hard problem. Several research have been conducted using some heuristic method to solve it. Some of these methods are Branch and Bound, Greedy Algorithms, Dynamic Programming, and Genetic Algorithms.However, when using GA, the feasibility of chromosome is one of critical issue. Most of optimization problem has constraint functions that will change the feasibility of solution. GA has some strategies to handle this case on the evaluation step. Evaluation not only calculates chromosome’s fitness value, but also handles the infeasible chromosomes presence. There’re rejecting strategies, repairing strategies, and penalty strategy.This paper develops a strategy GA approach with chromosome repairing strategy. In order to see the performance of the algorithm, we have done numerical experiment with several test problems taken on certain literature. In addition, this study will also give variations in GA parameter to determine the efficiency and effectiveness of the algorithm.
SISTEM PAKAR DIAGNOSA PENYAKIT PADA IKAN BUDIDAYA AIR TAWAR DENGAN METODE FORWARD CHAINING Aristoteles Aristoteles; Wardiyanto Wardiyanto; Ardye Amando Pratama
Jurnal Komputasi Vol 3, No 2 (2015)
Publisher : Universitas Lampung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.23960/komputasi.v3i2.1128

Abstract

Disease is an unwanted problem in freshwater fish cultivation. Lack of information to prevent the disease and limited number of expert in the field of fishery cause unoptimal harvest that leads to substantial loss. Based on that background, expert system to diagnose disease in freshwater fish cultivation is made in this research. This system is intended to help the fish cultivator in identifying diseases based on the symptoms that the fish have. Therefore, further treatment can be applied to cure the fish. The expert system is web-based with php and MySQL as the programming languages that are used as database. Forward chaining is used as the method of reasoning. This method is used to decide which rule is going to be executed, then it is executed. The process is repeated until the result comes up. This system is able to diagnose 33 diseases in 5 kinds of fish. There are 2 tests in this research which are internal and external. The result of the test shows that the system is able to diagnose well and meet the expectation. Moreover, on the management of the rule, the system is able to run as it is intended. This research has created a web based expert system application that can be used to diagnose diseases based on the facts given and give solutions like an expert.Keywords: Expert System, forward chaining, freshwater fish disease, freshwater fish cultivation.
APLIKASI PENYEDERHANAAN CONTEXT FREE GRAMMAR Rico Andrian; Wamiliana .; Andriyan Hutomo
Jurnal Komputasi Vol 3, No 2 (2015)
Publisher : Universitas Lampung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.23960/komputasi.v3i2.1133

Abstract

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 

Page 1 of 2 | Total Record : 19

 1   2 

Filter by Year

2015 2015


Reset
Filter By Issues
All Issue Vol 11, No 1 (2023): Jurnal Komputasi Vol 10, No 1 (2022) Vol 9, No 2 (2021) Vol 9, No 1 (2021): Komputasi Vol 8, No 2 (2020) Vol 8, No 1 (2020) Vol 7, No 2 (2019) Vol 7, No 1 (2019) Vol 6, No 2 (2018) Vol 6, No 1 (2018) Vol 5, No 2 (2017) Vol 5, No 1 (2017) Vol 4, No 2 (2016) Vol 4, No 1 (2016) Vol 4, No 1 (2016) Vol 3, No 2 (2015) Vol 3, No 1 (2015) Vol 2, No 2 (2014) Vol 2, No 1 (2014) Vol 1, No 2 (2013) Vol 1, No 1 (2013) Vol 1, No 1 (2013) More Issue