Article Per Year (5 Year)
p-Index From 2021 - 2026
2.779
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 Jurnal Teknik Industri: Jurnal Keilmuan dan Aplikasi Teknik Industri Indonesian Journal of Artificial Intelligence and Data Mining Prosiding Seminar Nasional Teknoka INSIST (International Series on Interdisciplinary Research) Jurnal Pengabdian Kepada Masyarakat (JPKM) Tabikpun Jurnal Eurekamatika Jurnal Siger Matematika Jurnal Komputasi
. Wamiliana
Universitas Lampung
Biochemistry, Genetics & Molecular Biology Chemical Engineering, Chemistry & Bioengineering Chemistry Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Education Electrical & Electronics Engineering Engineering Environmental Science Health Professions Industrial & Manufacturing Engineering Materials Science & Nanotechnology Mathematics Physics Other

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

Found 79 Documents
Search

 4   5   6   7   8 
PENGEMBANGAN APLIKASI PENYEDERHANAAN ALJABAR BOOLEAN DALAM BENTUK SUM-OF-PRODUCT DENGAN MENGGUNAKAN METODE QUINE MCCLUSKEY Wamiliana Wamiliana; Shara Siti Zahroh; Ossy Dwi Endah Wulandari
Jurnal Komputasi Vol. 1 No. 2 (2013)
Publisher : Jurusan Ilmu Komputer Fakultas MIPA Universitas Lampung

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

Abstract

This study implements the Quine McCluskey method to minimize the Boolean function. There are several methods can be used in the minimization of Boolean functions. Afrisal [1] conducted a study to apply the Karnaugh Map method. Tomaszewski [4] applied the Quine McCluskey method to make program to simplify Boolean Algebra with a maximum input function at most 4 variables which are initialized before. In this study, the Quine McCluskey implemented in the program and it can simplify the input function with a maximum length of 26 variables. That input can be entered directly via keyboard.Keywords: efficiency; minimization of Boolean Algebra; Quine McCluskey method.
PENGEMBANGAN ALGORITMA MOW DAN GENERALISASI BAHASA AUTOMATA UNTUK PROSES PEMBUATAN MINUMAN SERTA PENGEMBALIAN UANG PADA DESAIN MESIN KOPI OTOMATIS Wamiliana Wamiliana; Ossy Dwi Endah Wulandari; Marisa Ayu Rahmadhani
Jurnal Komputasi Vol. 1 No. 2 (2013)
Publisher : Jurusan Ilmu Komputer Fakultas MIPA Universitas Lampung

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

Abstract

The remarkably development in science and technology influences the business trend. One of the mode of businesses that are used widely nowadays is vending machine. Vending machine is a machine that is able to serve client for food, drink and others after the costumers put money into machine slot. This research discusses about an application of coffee vending machine that can make variation of coffee and optimalize output of the money. In making this application, Finite State Automata (FSA) is applied to handle the problem for recognize language in making a drink and MOW algorithm used to optimalize output of  money in transaction processing. Keywords : Coffee Vending Machine, Finite State Automata, Optimalize,   Algorithm
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 : Jurusan Ilmu Komputer Fakultas MIPA 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'.
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 : Jurusan Ilmu Komputer Fakultas MIPA 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.
IMPLEMENTASI METODE DYNAMIC PROGRAMMING PADA APLIKASI PENENTUAN JARAK MINIMUM Wamiliana Wamiliana; Dian Kurniasari; Fatkur Rokhman
Jurnal Komputasi Vol. 1 No. 1 (2013)
Publisher : Jurusan Ilmu Komputer Fakultas MIPA Universitas Lampung

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

Abstract

Mathematics and Computer Science are closely related. Many problems that appear in Computer Science’s problems can be solved by using mathematical techniques or concepts; for example, finding the nearest distance, minimum fares, or minimum time. The determination of the minimum value can be found by using of mathematical programming, namely dynamic programming. Nevertheless, there are several another consideration factors such as security roads impassable, the vehicle used, comfortability road infrastructure, and others. Dynamic programming is one of the methods in mathematics which is useful to create a sequence of interrelated decisions, and provides a systematic procedure to determine the optimal combination of a decision. This paper will discuss about dynamic programming that applied in the determination of the minimum distance. Determination of the minimum distance will use an application to make it easier for calculation.Keywords: mathematics, dynamic programming, minimum distance, application
IMPLEMENTASI ALGORITMA BACKTRACK UNTUK PENCARIAN SOLUSI KNIGHT’S TOUR PROBLEM PADA PAPAN CATUR m x n Wamiliana Wamiliana; Dian Kurniasari; Dolly Yudhistira
Jurnal Komputasi Vol. 1 No. 1 (2013)
Publisher : Jurusan Ilmu Komputer Fakultas MIPA 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
PEMBUATAN MEDIA PEMBELAJARAN PENGENALAN TATA SURYA DAN EXOPLANET DENGAN MENGGUNAKAN UNITY UNTUK SEKOLAH MENENGAH PERTAMA Wamiliana Wamiliana; Dian Kurniasari; Jevri Setia Nugraha
Jurnal Komputasi Vol. 1 No. 1 (2013)
Publisher : Jurusan Ilmu Komputer Fakultas MIPA Universitas Lampung

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

Abstract

Technology development currently making human life be more practical. There are many ways to use technology like for entertainment, business, and education. The use of technology in education is still not optimal so that the educational process is still using the old system where students listen and the teachers explain. One of the education technology is to do the process of learning using the  multimedia interactive. Subjects about the solar system is one of the subjects taught in junior high school, but the topics about exoplanets or planets which are outside the solar system are seldom given by the teacher. Most junior high school used the interactive multimedia to help learning process but it is still 2D-based and only gave topics about the solar system. Therefore, in this paper we discused about the design and development of an interactive multimedia which contains topics about solar system and exoplanets with animated interactive multimedia in 3D-based. This application will be more attractive, and the users can use it interactively.Keywords: 3D-based interactive multimedia, education, solar system and exoplanet, technology development.
PENERAPAN KONSEP FINITE STATE AUTOMATA (FSA) PADA MESIN PEMBUAT MINUMAN KOPI OTOMATIS Wamiliana Wamiliana; Didik Kurniawan; Rizky Indah Melly
Jurnal Komputasi Vol. 1 No. 1 (2013)
Publisher : Jurusan Ilmu Komputer Fakultas MIPA Universitas Lampung

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

Abstract

This research discusses about a simulating application for automatic coffee machine which can do processes of making 7 types of choices of drinks; coffee, milk, chocolate, coffee milk, coffee brown, mocha, and chocolate milk automatically. In this application, the concept of Finite State Automata (FSA) was applied to recognize and to capture the pattern on the process for making coffee drinks. In this application, Finite State Automata (FSA) was applied to read input symbols given from the starting state to the final state in order to get the language recognized by the machine. Further, the process will be done accordance with the read language.Keywords: Coffee Machine, Finite State Automata (FSA), Language and Automata Theory.
perbandingan kompleksitas algoritma prim, algoritma kruskal, dan algoritma sollin untuk menyelesaikan masalah minimum spanning tree Didik Kurniawan; Wamiliana Wamiliana; Cut Shavitri Nursanti Fauzi
Jurnal Komputasi Vol. 2 No. 1 (2014)
Publisher : Jurusan Ilmu Komputer Fakultas MIPA 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.
PENGEMBANGAN APLIKASI ENCODE DAN DECODE TREE MENGGUNAKAN BLOB CODE Astria Hijriani; Wamiliana Wamiliana; Ady Candra
Jurnal Komputasi Vol. 2 No. 2 (2014)
Publisher : Jurusan Ilmu Komputer Fakultas MIPA Universitas Lampung

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

Abstract

Tree Structure is used widely to represent problems in daily life, especially in computer science and technology. One method that is used to represent a tree is Blob Code. In this research, we developed an application to Encode and Decode Tree using Blob Code. This application aims to simplify the process of changing tree into a blob code (encode) and the process of changing Blob code into the form of tree (decode). Keywords: Encode, Decode, Tree, representation Tree, Blob Code.
Co-Authors . Amanto Aang Nuryaman Ade Hardiyanti Ady Candra Afdi Patria Ahmad Faisol Ahya Shofa Ananda Akmal Junaidi Akmal Junaidi Alifah Zahroh 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 Cut Shavitri Nursanti Fauzi Dako Adi Ahmadi Depriyanto Depriyanto Desiana Putri Dian Kurniasari Dian Kurniasari Dian Kurniasari Didik Kurniawan Didik Kurniawan Dina Eka Nurvazly Dolly Yudhistira 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 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 Nairobi Notiragayu Notiragayu Notiragayu Novi Hardiansyah Ossy Dwi Endah Wulansari Pandya Panditatwa pita utari ningtyas Poetri Hana Nurhandayani Pradana Marlando Reni Permata Sari Reni Permata Sari Riska Aulia Putri Rizky Indah Melly Rizqi Chandra Aditya Roro Ayu Martinez Shara Siti Zahroh Silvi Fitriani Siti Laelatul Chasanah Sulistian Oskavina Thomas Juliansyah Tryo Romadhoni Pujakusuma Warsono Warsono Wisnu Wardhana Wisnu Wardhana Wiwin Susanty Yudi Antoni