Article Per Year (5 Year)
p-Index From 2020 - 2025
0.888
P-Index
This Author published in this journals
All Journal AKSIOMA: Jurnal Program Studi Pendidikan Matematika Science and Technology Indonesia Jurnal Komputasi Desimal: Jurnal Matematika Indonesian Journal of Artificial Intelligence and Data Mining Prosiding Seminar Nasional Teknoka BAREKENG: Jurnal Ilmu Matematika dan Terapan Jurnal Pengabdian Kepada Masyarakat (JPKM) Tabikpun
Wamiliana Wamiliana
University of Lampung
Biochemistry, Genetics & Molecular Biology Chemical Engineering, Chemistry & Bioengineering Chemistry Computer Science & IT Control & Systems Engineering Economics, Econometrics & Finance Education Energy Engineering Environmental Science Health Professions Materials Science & Nanotechnology Mathematics Mechanical Engineering Physics Social Sciences Transportation

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

Found 10 Documents
Search

 1 
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   
Application of the Artificial Neural Network Algorithm to Predict the Realization of the Duty Tax on the Name of Motor Vehicles in Lampung Province Kurniasari, Dian; Ramadhani, Putri Salsabila; Wamiliana, Wamiliana; Warsono, Warsono
Indonesian Journal of Artificial Intelligence and Data Mining Vol 7, No 2 (2024): September 2024
Publisher : Universitas Islam Negeri Sultan Syarif Kasim Riau

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24014/ijaidm.v7i2.29456

Abstract

Regional taxes, specifically the Motor Vehicle Name Return Tax (BBNKB), provide the primary source of revenue for regions from the several forms of taxes. The BBNKB tax is crucial in funding government and regional development due to its significant annual growth, encompassing four-wheeled and two-wheeled vehicles. Furthermore, the BBNKB tax catalyzes regional economic expansion and significantly contributes to the government's income. Hence, predicting and forecasting the BBNKB Tax in Lampung Province is necessary to monitor future tax rate fluctuations. That will enable the government to devise innovative tax payment systems and establish tax revenue targets. This study utilizes the Artificial Neural Network (ANN) methodology, using many approaches for distributing training and testing data to forecast. In addition, we utilize hyper-tuning on several factors to obtain the most favourable configurations. The ideal model achieved has a training data allocation of 80% and a testing data allocation of 20%. It was trained for 50 epochs and used a batch size of 16. The model has exceptional predictability, attaining an accuracy rating of 96.51%. Additionally, it showcases a low Root Mean Square Error (RMSE) of 0.246 and a minimal Mean Absolute Percentage Error (MAPE) score of 3.48%. Therefore, it is appropriate to predict the next two-year term. As a result, the forecast for the amount of tax collected from motor vehicle name returns in Lampung has fluctuated.
The relationship of the formulas for the number of connected vertices labeled graphs with order five and order six without loops Amanto, Amanto; Notiragayu, Notiragayu; Zakaria, La; Wamiliana, Wamiliana
Desimal: Jurnal Matematika Vol. 4 No. 3 (2021): Desimal: Jurnal Matematika
Publisher : Universitas Islam Negeri Raden Intan Lampung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24042/djm.v4i3.10006

Abstract

Given a graph with n points and m lines. If each vertex is labeled, then it can be constructed many graphs, connected, or disconnected graphs. A graph G is called a connected graph if there is at least one path that connects a pair of vertices in G. In addition, the graph formed may be simple or not simple. A simple graph is a graph that does not contain loops or parallel lines. A loop is a line that connects a point to itself, and a parallel line is two or more lines that connect the same pair of points. This paper will discuss the relationship between the formula patterns for calculating the number of connected graphs labeled with vertices of order five and six without loops.
PERFORMANCE OF THE ACCURACY OF FORECASTING THE CONSUMER PRICE INDEX USING THE GARCH AND ANN METHODS Kurniasari, Dian; Mukhlisin, Zaenal; Wamiliana, Wamiliana; Warsono, Warsono
BAREKENG: Jurnal Ilmu Matematika dan Terapan Vol 17 No 2 (2023): BAREKENG: Journal of Mathematics and Its Applications
Publisher : PATTIMURA UNIVERSITY

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30598/barekengvol17iss2pp0931-0944

Abstract

The Consumer Price Index (CPI) is the most widely used indicator of the inflation rate. Then, the value of CPI in the future must be known to be the basis of the government's making appropriate and accurate policies. The CPI data used in this study was taken from the Central Statistics Agency (BPS) from January 2006 - to December 2021. The CPI data used has a data pattern containing symptoms of heteroskedasticity. To overcome the symptoms of heteroskedasticity, the author uses the GARCH and ANN methods to determine the value of CPI in the future. The GARCH method can overcome the symptoms of heteroskedasticity in the time series forecasting process, while ANN is an effective method in time series forecasting because of its high level of accuracy. In this study, mape error calculation results were obtained with the ARIMA model (4,2,2)~GARCH(1.1) of 3.19% or with an accuracy of 96.81%, and ANN using two hidden layers of 1.24% or with an accuracy of 98.76%. Thus, the results of this study show that the ANN method is the best method of forecasting Consumer Price Index (CPI) data.
Training for Understanding Mathematics Olympiad for Students and Teachers of SMAN 2 Kalianda Ansori, Muslim; Wamiliana, Wamiliana; Nurvazly, Dina Eka; Chasanah, Siti Laelatul
Jurnal Pengabdian Kepada Masyarakat (JPKM) TABIKPUN Vol. 6 No. 1 (2025)
Publisher : Faculty of Mathematics and Natural Sciences - Universitas Lampung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.23960/jpkmt.v6i1.192

Abstract

Untuk mencapai kesuksesan dalam kompetisi olimpiade matematika diperlukan bimbingan dan persiapan yang baik. Oleh karena itu, kegiatan pelatihan penguasaan dan pemahaman materi olimpiade matematika bagi siswa dan guru SMAN 2 Kalianda diinisiasi untuk memberikan dukungan kepada guru-guru matematika dan siswa di SMA tersebut. Metode yang digunakan yaitu melibatkan ceramah, tanya jawab, dan simulasi. Tujuan dari kegiatan ini adalah untuk menciptakan lingkungan pembelajaran yang lebih efektif di tingkat sekolah menengah atas, memotivasi siswa untuk aktif mengikuti pembinaan, dan membantu mereka memahami materi olimpiade matematika dengan lebih baik. Hasil yang diperoleh dari kegiatan ini yaitu pemahaman dan keterampilan guru-guru meningkat dalam membimbing siswa untuk menghadapi olimpiade matematika, terlihat dari hasil peningkatan nilai pada post-test siswa.
Co-Authors Ahmad Adi Wijaya, Ahmad Adi Alifah Zahroh, Alifah Amanto Amanto Andrian, Rico Dian Kurniasari Dian Kurniasari Dina Eka Nurvazly, Dina Eka Dolly Yudhistira, Dolly Dwi Sakethi, Dwi Kristanto, Paustinus Edi Maulana, Mas Dafri Mukhlisin, Zaenal Muslim Ansori Notiragayu, Notiragayu Ramadhani, Putri Salsabila Siti Laelatul Chasanah, Siti Laelatul Suharsono Suharsono Suhika, Dewi Warsono Warsono Wisnu Wardhana Zakaria, La