Claim Missing Document
Check
Articles

Found 7 Documents
Search

Penelusuran Bug Program Simulasi Pencetakan Transkrip SIAKAD Unila dengan Metode Whitebox dan Solusi Menggunakan Variabel Memori Sakethi, Dwi; Wamiliana, Wamiliana; Wardhana, Wisnu; Zahroh, Alifah
Jurnal Komputasi Vol 3, No 1 (2015)
Publisher : Universitas Lampung

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

Abstract

AbstractIn tracking of SIAKAD transcript, there was found a bug, that is the arrangement of the lesson position at the tenth till fifteenth semester located between first and second semester. Process tracking bug did in simulation program. In this research, carried out a development of the original program Siakad as simulation program that will be analyzed, to find out where is bug in the system. Development this program using PHP and MySQL database software. Tracking bug using whitebox testing method, it can be determined whether there is a bug in the procedural structure of the program or just on the operational function of the system itself. Bugs can be repaired by adding some changes on source code of the program. The changes are determination of new variables as memory variables and application of Bubble sort method on sorting proccess. The result shows bugs on the program is fixed. Keywords: Bubble sort, Bug, MySQL, PHP, Siakad, Whitebox
ANALISIS PERBANDINGAN ALGORITMA ASIMETRIS ELGAMAL DAN MASSEY-OMURA DALAM ENKRIPSI DAN DEKRIPSI DATA Wijaya, Ahmad Adi; Wamiliana, Wamiliana; Andrian, Rico
Jurnal Komputasi Vol 4, No 1 (2016)
Publisher : Universitas Lampung

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

Abstract

Information can be kept secure by an encryption process in cryptograpy technigue. In this research we discussed comparative analysis of asymmetric algorithms ElGamal and Massey-Omura in terms of their complexities, time, and speed performances. The testing was conducted using 30 data with size  varies between 66 bytes and 2000 bytes. Thirty data were tested 50 times. The result shows that Elgamal Algorithm is faster in encryption and decryption compared to Massey-Omura Algorithm and the complexity of both algorithms are linear algorithms (O (n)).
Perbedaan Solusi Masalah Instalasi Jaringan Multi Tahap Dalam Proses Koneksi Menggunakan Algoritma Modifikasi Prim dan GNU Octave Wamiliana, Wamiliana; Warsono, Warsono; Maulana, Mas Dafri
Prosiding Seminar Nasional Teknoka Vol 2 (2017): Prosiding Seminar Nasional Teknoka ke - 2
Publisher : Fakultas Teknik, Universitas Muhammadiyah Prof. Dr. Hamka, Jakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Desain jaringan merupakan salah satu bidang yang banyak terapannya dalam optimisasi kombinatorik. Masalah Instalasi Jaringan Multi Tahap atau Multiperiod Degree Constrained Minimum Spanning Tree (MPDCMST) merupakan salah satu masalah desain jaringan dimana akan ditentukan biaya minimum untuk menghubungkan titik-titik yang dipertimbangkan pada tahap-tahap tertentu, dan tidak melanggar syarat  atau kendala yang diberikan . Kendala yang diberikan adalah interkoneksi pada tiap titik tidak melebihi b, b= integer nonnegatif.   Selain itu,  ada skala prioritas titik-titik yang harus terhubung pada tahap tahap tertentu. Pada penelitian ini akan didiskusikan  proses instalasi/koneksi tiap titik pada masing-masing tahap yang menggunakan Modifikasi Algoritma Prim untuk menyelesaikannya. Ada dua algoritma (WWM1 dan WWM2) yang akan dibandingkan proses instalasinya. Hasil penelitian menunjukkan bahwa algoritma WWM2 memberikan solusi yang lebih baik dari algoritma WWM1.
PENGGUNAAN METODE CUTTING PLANE UNTUK MENYELESAIKAN MINIMUM SPANNING TREE DENGAN KENDALA BOBOT PADA GRAF K_n Suhika, Dewi; Wamiliana, Wamiliana
AKSIOMA: Jurnal Program Studi Pendidikan Matematika Vol 7, No 1 (2018)
Publisher : UNIVERSITAS MUHAMMADIYAH METRO

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (436.4 KB) | DOI: 10.24127/ajpm.v7i1.1353

Abstract

This study aims to determine the minimum spanning tree of a complete graph K_n with weight constraints and completion using the cutting plane method. The cutting plane method is one of the algorithms included in the exact method. This algorithm works by reducing the solution area so that it becomes narrower. As a result, the feasible solutions that will be investigated become less and less. This is because the cutting plane method works based on the optimal linear programming solution of relaxation solved by the simplex method. In this paper we give illustration of the algorithm applied for two cases, one for K_4 and one for K_5.
IMPLEMENTASI ALGORITMA BACKTRACK UNTUK PENCARIAN SOLUSI KNIGHT’S TOUR PROBLEM PADA PAPAN CATUR m x n Wamiliana, Wamiliana; Kurniasari, Dian; Yudhistira, Dolly
Jurnal Komputasi Vol 1, No 1 (2013)
Publisher : Universitas Lampung

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

Abstract

This research discusses about finding all solutions of The Knight's Tour Problem. The steps done by a knight on a chess board forms a path. If the track is able to pass through all points (boxes)  and can return to the original point (box)  is called as Hamilton Cycle, that produces Closed Knight's Tour;  if the path can pass through all the points but can not return to the original point of the track is called as Open Knight's Tour. There are various ways to solve the Knight's Tour Problem, one of which is to use the Backtrack algorithm. In this paper we will discuss of finding all solutions of Knight’s Tour Problem vary from 3x3 up to 8x8 chessboards.Keywords: knight’s tour problem, backtrack algorithm, open and closed knight’s tour
Counting the sum of cubes for Lucas and Gibonacci numbers Wamiliana, Wamiliana; Suharsono, Suharsono; Kristanto, Paustinus Edi
Science and Technology Indonesia Vol 4 No 2 (2019): April
Publisher : ARTS Publishing

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (927.852 KB) | DOI: 10.26554/sti.2019.4.2.31-35

Abstract

Lucas and Gibonacci numbers are  two  sequences of numbers derived from a welknown numbers, Fibonacci numbers. The difference between Lucas and Fibonacci numbers only lies on the first and second elements.  The first element in Lucas numbers  is 2 and the second is 1, and nth element,  n ? 3 determined by similar pattern as in the Fibonacci numbers, i.e : Ln = Ln-1  + Ln-2.  Gibonacci numbers  G0 , G1 ,G2 , ...; Gn = Gn-1 + Gn-2 are generalized of Fibonacci numbers, and those numbers are nonnegative integers. If G0 = 1 and G1 = 1, then the numbers are the wellknown Fibonacci numbers, and if G0 = 2 and G1 = 1, the numbers are Lucas numbers. Thus, the difference of those three sequences of numbers only lies on the first and second of the elements in the sequences.  For Fibonacci numbers there are quite a lot identities already explored, including the sum of cubes, but there have no discussions yet about the sum of cubes for Lucas and Gibonacci numbers. In this study the sum of  cubes of Lucas and Gibonacci numbers will be discussed and showed that the sum of cubes for Lucas numbers  is   and for Gibonacci numbers is   
SOLVING THE DEGREE CONSTRAINED MINIMUM SPANNING TREE PROBLEM USING TABU AND MODIFIED PENALTY SEARCH METHODS Wamiliana, Wamiliana
Jurnal Teknik Industri Vol 6, No 1 (2004): JUNE 2004
Publisher : Institute of Research and Community Outreach - Petra Christian University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (49.844 KB) | DOI: 10.9744/jti.6.1.pp. 1-9

Abstract

In this paper we consider the Degree Constrained Minimum Spanning Tree Problem. This problem is concerned with finding, in a given edge weighted graph G (all weights are non-negative), the minimum weight spanning tree T satisfying specified degree restrictions on the vertices. This problem arises naturally in communication networks where the degree of a vertex represents the number of line interfaces available at a center. Because of its NP-completeness, a number of heuristics have been proposed. In this paper we propose two new search methods: one based on the method of Tabu search and the other based on a penalty function approach. For comparative analysis, we test our methods on some benchmark problems. The computational results support our methods.