Article Per Year (5 Year)
p-Index From 2019 - 2024
3.149
P-Index
This Author published in this journals
All Journal International Journal of Engineering Science and Technology Development (IJEST) AdMathEdu : Jurnal Ilmiah Pendidikan Matematika, Ilmu Matematika dan Matematika Terapan International Conference on Engineering and Technology Development (ICETD) Explore: Jurnal Sistem Informasi dan Telematika (Telekomunikasi, Multimedia dan Informatika) Science and Technology Indonesia Jurnal Komputasi Desimal: Jurnal Matematika Jurnal Teknik Industri Indonesian Journal of Artificial Intelligence and Data Mining Prosiding Seminar Nasional Teknoka BAREKENG: Jurnal Ilmu Matematika dan Terapan INSIST (International Series on Interdisciplinary Research) Jurnal Pengabdian Kepada Masyarakat (JPKM) Tabikpun Jurnal Eurekamatika Jurnal Siger Matematika Jurnal Pengabdian Masyarakat Tapis Berseri (JPMTB)
. Wamiliana
Universitas 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 Industrial & Manufacturing Engineering Materials Science & Nanotechnology Mathematics Mechanical Engineering Physics Social Sciences Transportation Other

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

Found 51 Documents
Search

 1   2   3   4   5 
perbandingan kompleksitas algoritma prim, algoritma kruskal, dan algoritma sollin untuk menyelesaikan masalah minimum spanning tree Kurniawan, Didik; Wamiliana, Wamiliana; Fauzi, Cut Shavitri Nursanti
Jurnal Komputasi Vol 2, No 1 (2014)
Publisher : Universitas Lampung

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

Abstract

Pada penelitian ini didiskusikan tentang kempleksitas algoritma dari tiga algoritma yaitu Algoritma Prim, Algoritma Kruskal, dan Algoritma Sollin. Graf yang digunakan untuk implementasi adalah graf lengkap dengan jumlah vertex 10 sampai dengan 100 dengan increment 10 dan data yang digunakan dibangkitkan secara random dengan bobot nilai antara 1 sampai dengan 1000. Untuk implementasi data dikembangkan source code dengan menggunakan Bahasa Pemrograman C++ dan dari hasil implementasi didapat hasil dan dapat dibuktikan bahwa ketiga algoritma tersebut mempunyai kompleksitas O(n2). Kata kunci: Algoritma, Kompleksitas Algoritma, Algoritma Kruskal, Algoritma Prim, Algoritma Sollin.
Comparative Analysis for The Multi Period Degree Minimum Spanning Tree Problem . Wamiliana; . Amanto; Mustofa Usman
International Conference on Engineering and Technology Development (ICETD) 2013: 2nd ICETD 2013
Publisher : Bandar Lampung University (UBL)

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (309.108 KB)

Abstract

The Multi Period Degree Constrained Minimum Spanning Tree Problem (MPDCMST) concerns of finding the total minimum cost of networks installation, where the installation process is divided into some periods. In the beginning of installation process, thecenter of the networks already set (as server, reservoir, etc). The installation process is divided into some period due to some factors, usually fund limitation. During the installation process, the networks is supposed to be maintained its reliability by restrict the numbers of links that can be connected to the node that already in the networks. In this paper we will discuss and improve the performance of WADR1 and WADR2 algorithms by setting the number of elements in the set of vertices that must be in installed in a certain period as a fix number and adding the length of the path in DFS. The result shows that the modifications works better. 
ANALISIS PERBANDINGAN ALGORITMA SIMETRIS TINY ENCRYPTION ALGORITHM DAN LOKI DALAM ENKRIPSI DAN DEKRIPSI DATA Pradana Marlando; Wamiliana Wamiliana; Rico Andrian
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.1153

Abstract

Information can be kept secure by an encryption process in cryptography technique. In this research we discussed comparative analysis of symmetric algorithms: Tiny Encryption Algorithm (TEA) and LOKI in terms of their complexity, time and speed performances. The testing was conducted using 30 data with size varies between 50 bytes and 1500 bytes. Thirty data were tested 50 times. The result shows that TEA is faster in encryption and decryption compared to LOKI  and the complexity of both algorithms are linear algorithms (O (n)).
PENGEMBANGAN SISTEM PAKAR BERBASIS WEB MOBILE UNTUK MENGIDENTIFIKASI PENYEBAB KERUSAKAN TELEPON SELULER DENGAN MENGGUNAKAN METODE FORWARD DAN BACKWARD CHAINING Wamiliana Wamiliana; Aristoteles Aristoteles; Depriyanto Depriyanto
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.392

Abstract

Phone cell users are now countless, but many of them are not able to solve the problem if there are damages to their phones. This paper discusses about the development of expert system that can assist to identify those damages. This system uses forward chaining and backward chaining methods which are known as the searching techniques in getting a conclusion of the existing problem, and this system is built by using PHP programming language and MySQL as the database, and it can only be accessed by using a mobile browser.
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 
DESAIN STRATEGI “BARCA STYLE” DAN RESPON PEMAIN PADA SIMULASI PERMAINAN SEPAK BOLA MENGGUNAKAN ALGORITMA KUCHIYOSE Didik Kurniawan; Wamiliana Wamiliana; Afdi Patria
Jurnal Komputasi Vol 1, No 2 (2013)
Publisher : Universitas Lampung

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

Abstract

Nowadays, football is not just a sport performed by humans. The development of football has offered a variety of integration technologies in diverse of forms such as ball type, shoes, games, etc. The game that associated with football is now in a great demand by many people, such as PES 2013. Football game needs game strategies that determine the success of the game. Recently, one of the great team that has won numerous competitions is Barcelona FC. This club has interesting features and powerful enough to win the game. The unique feature is 'Barca style', which is the short passing between players. Basically there are three main roles in the game of football which are the player who controlled the ball, a player that supports the movement of the player who had the ball, and the opposing player trying to snatch the ball. In order to find solutions to address the characteristics of the ‘Barca Style’ we represent the game as mathematical model and design a simulation that uses a strategy game guarding one on one, and the total survival strategy against the strategy of 'Barca style'.
IMPLEMENTASI TEKNIK STEGANOGRAFI MENGGUNAKAN METODE ADAPTIVE MINIMUM ERROR LEAST SIGNIFICANT BIT REPLACEMENT (AMELSBR) Astria Hijriani; Wamiliana Wamiliana; Pandya Panditatwa
Jurnal Komputasi Vol 2, No 2 (2014)
Publisher : Universitas Lampung

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

Abstract

Security is an important aspect in digital data transmission, and steganography is one way for hiding a secret message in such a way so that others are not aware of the existence of something in the message. In this research, we built a digital steganography system using web-based with Adaptive Minimum - Error Least Significant Bit Replacement (AMELSBR) method. The media to hide the message is on the form of .jpg, the output is on the form of .png, and the message is on the form of .txt. The procedures for applying AMELSBR method are Capacity Evaluation, Minimum - Error Replacement and Error Diffusion. The result shows that the AMELSBR method is able to manage for hiding and restoring files without causing excessive distortion (noise) in stego image. The AMELSBR method has a possibility of returning most files to image manipulation such as the change of image Brightness and Contrast with the black color dominant (rgb(0,0,0)), white color dominant (rgb(255,255,255)).
RANCANG BANGUN APLIKASI SEARCH ENGINE REPOSITORY SOFTWARE DESKTOP MENGGUNAKAN TEKNIK WEB EXTRACTION Dako Adi Ahmadi; Wamiliana Wamiliana; Wisnu Wardhana
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.1182

Abstract

The System Search Engine Repository Software Desktop was created with the aim for facilitating the users to get the software to be installed or used by the user. For Windows operating systems and Macintosh, the system can download and check the latest version of the software that is already available. The system created provides a freeware software for Windows and Macintosh operating systems. For Linux, the system displays and generates sources.list of Debian. In this research the system made using Extreme Programming and using web extraction techniques to extract data from website www.filehippo.com. Keywords: web scraping, search engine, extreme programming, web extraction.
Pembangunan Tools Pembelajaran Pemrograman Java Melalui Live CD / Live USB Irwan Adi Pribadi; Wamiliana Wamiliana; Ervan Heppyda; Wisnu Wardhana
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.1034

Abstract

Linux is an open source operating system. Everyone can change and develop the Linux operating system as needed. In this research we use Linux operating system to generate a new operating system that supports learning Java programming. The resulting operating system is runs via Live CD / Live USB. The operating system has been successfully created and can be used as learning tools for Java programming.
IMPLEMENTASI STEGANOGRAFI UNTUK MENYISIPKAN PESAN TEKS PADA MEDIA GAMBAR DENGAN METODE END OF FILE Wamiliana Wamiliana; Astria Hijriani; Azharico Darusman
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.1127

Abstract

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
Co-Authors . Amanto Aang Nuryaman Ade Hardiyanti Afdi Patria Ahmad Faisol Ahya Shofa Ananda Akmal Junaidi Akmal Junaidi Amanto Amanto Amanto Andikha Yunar Cornelius Dabukke Andrian, Rico Andriyan Hutomo Astri Reformasari Astria Hijriani Astria Hijriani Astria Hijriani Attiya Yuliana Azharico Darusman Bainah Sari Dewi Dako Adi Ahmadi Depriyanto Depriyanto Desiana Putri Dian Kurniasari Didik Kurniawan Didik Kurniawan Dina Eka Nurvazly Dwi Sakethi Dwi Yatmoko Siambudi Dyan Shandy Utama Edwin Russel Edwin Russel Eka Fitri Jayanti Ervan Heppyda Fadila Cahya Puri Fadila Cahya Puri Fahmi Kharismaldie Faiz AM Elfaki Fajar Sidik Fatkur Rokhman Fauzi, Cut Shavitri Nursanti Febi Eka Febriansyah Febi Eka Febriansyah Fitriani Grita Tumpi Nagari Irwan Adi Pribadi Ismail Indra Pratama Ismawati Ismawati Izzatuz Zakiyah Mukhtarisa Jamal I. Daoud Jani Master Jani Suparman Jevri Setia Nugraha Karina Sylfia Dewi La Zakaria La Zakaria Louis Caccetta Marisa Ayu Rahmadhani Mas Dafri Maulana Mira Mustika Misgiyati Misgiyati Muslim Ansori Muslim Ansori Muslim Ansori Mustofa Usman Mustofa Usman Mustofa Usman Mustofa Usman Mustofa Usman Nairobi Notiragayu Notiragayu Notiragayu Novi Hardiansyah Nuning Nurcahyani Ossy Dwi Endah Wulansari Pandya Panditatwa pita utari ningtyas Poetri Hana Nurhandayani Pradana Marlando Reni Permata Sari Reni Permata Sari Rizky Indah Melly Silvi Fitriani Siti Laelatul Chasanah Sulistian Oskavina Tryo Romadhoni Pujakusuma Warsono Warsono Warsono Warsono Widiarti Wisnu Wardhana Wisnu Wardhana Wiwin Susanty Yudi Antoni Zaenal Mukhlisin