Garuda - Garba Rujukan Digital

p-Index From 2021 - 2026

2.595

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

. Wamiliana

Universitas Lampung

Author-ID : 2667223

Biochemistry, Genetics & Molecular Biology Chemical Engineering, Chemistry & Bioengineering Chemistry Computer Science & IT Education Engineering Environmental Science Health Professions Industrial & Manufacturing Engineering Materials Science & Nanotechnology Mathematics Physics Other

Published : 48 Documents Claim Missing Document

Claim Missing Document

Articles

1 2 3 4 5

PENERAPAN ALGORITMA SEQUENTIAL SEARCH DALAM PROSES PENCARIAN INFORMASI PADA SISTEM PEMBELAJARAN ORGAN JANTUNG MANUSIA Wamiliana Wamiliana; Ade Hardiyanti; Wisnu Wardhana
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.1199

Without no doubt, technology supports the human life and can be applied in many aspects, for example ineducation development. Learning process using computer as an aided tools are commonly used. The Applicationof Sequential Search Algorithm for The Searching Process of Information in The Learning System of Human’sHeart is an example of the application of computer in education that can be one of solution to help the learningprocess for teachers, lecturers, or students. In this research we use the sequential search algorithm searchingprocess in learning system of human’s heart which is one of the search methods to facilitate text searches of theinformation that required by the user. This system gives information about the material that is related to the heartorgan, i.e, heart anatomy, heart physiology, and heart pathology. The testing systems that used in this applicationis Black Box method. Black Box Testing is focuses on the functional requirements of the software. Black BoxTesting is used for testing the system in order to know if the system work well.Keyword: Black Box Testing; Heart; Sequential Search; Technology.

The Modified CW1 Algorithm For The Degree Restricted Minimum Spanning Tree Problem . Wamiliana; Louis Caccetta
International Journal of Engineering Science and Technology Development (IJEST) Vol 1, No 2 (2013): August
Publisher : University of Bandar Lampung (UBL)

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

Given edge weighted graph G (all weights are non-negative), The Degree Constrained Minimum Spanning Tree Problem is concerned with finding 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 terminal (center). The applications of the Degree Constrained Minimum Spanning Tree problems that may arise in real-life include: the design of telecommunication, transportation, and energy networks. It is also used as a subproblem in the design of networks for computer communication, transportation, sewage and plumbing. Since, apart from some trivial cases, the problem is computationally difficult (NP-complete), a number of heuristics have been proposed. In this paper we will discuss the modification of CW1 Algorithm that already proposed by Wamiliana and Caccetta (2003). The results on540 random table problems will be discussed.

BEBERAPA IDENTITAS BARISAN FIBONACCI DAN LUCAS Mira Mustika; Wamiliana Wamiliana
AdMathEdu : Jurnal Ilmiah Pendidikan Matematika, Ilmu Matematika dan Matematika Terapan Vol 9, No 2: Desember 2019
Publisher : Universitas Ahmad Dahlan

Penelitian ini bertujuan untuk menyelidiki hubungan antara barisan Fibonacci dan Lucas, dan membuktikan identitas-identitas barisan Fibonacci dan Lucas. Barisan Fibonacci dan Lucas merupakan barisan rekursif yang mempunyai aturan yang sama namun memiliki nilai awal yang berbeda. Dalam penelitian ini, akan dibahas beberapa identitas yang melibatkan kedua barisan tersebut, serta satu identitas yang berkaitan dengan segitiga Pascal.

Counting the Number of Disconnected Labeled Graphs of Order Five without Paralel Edges Wamiliana Wamiliana; Amanto Amanto; Grita Tumpi Nagari
INSIST Vol 1, No 1 (2016)
Publisher : Universitas Lampung

Abstract— Given a graph G(V,E) with n vertices and m edges, where every vertex is labeled, there are a lot of possible graphs that can be constructed, either connected graphs or disconnected, simple or not simple. A graph G(V,E) is called as a connected graph if there exists at least one path between every pair of vertices in G, and otherwise, G is disconnected. A graph G is called as a labeled graph if every node/vertex and or every edge is labeled. In this research, we are concerning about a graph where every vertex is labeled. Parallel edges are two edges or more which have the same end points. In this research we found that the number of disconnected labeled graph without parallel edges for and can be obtained with the following formula: {{. is the number of disconnected labeled graph without parallel edges for and . Keywords— counting graph, labeled graph, disconnected, parallel edges

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

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 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 : Universitas Lampung

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

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

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

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 : Universitas Lampung

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

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.

PERBANDINGAN METODE ADAPTIVE MINIMUM ERROR LEAST SIGNIFICANT BIT REPLACEMENT (AMELSBR) DAN DISCRETE COSINE TRANSFORM (DCT) UNTUK STEGANOGRAFI CITRA DIGITAL Fajar Sidik; wamiliana wamiliana; Febi Eka Febriansyah
Jurnal Komputasi Vol 6, No 1 (2018)
Publisher : Universitas Lampung

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

Insertion of secret messages with steganography is one way to hide secret messages. In this research we will compare AMELSBR and DCT methods based on web application using image as the media for hiding the secret message. The file format used are (.png) as input cover and stegoimage, and (.txt) as data inserted. The result shows that AMELSBR method better than DCT method for manipulation of brightness, contrast, and cropping.

SOLVING THE DEGREE CONSTRAINED MINIMUM SPANNING TREE PROBLEM USING TABU AND MODIFIED PENALTY SEARCH METHODS Wamiliana Wamiliana
Jurnal Teknik Industri: Jurnal Keilmuan dan Aplikasi Teknik Industri Vol. 6 No. 1 (2004): JUNE 2004
Publisher : Institute of Research and Community Outreach - Petra Christian University

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.

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 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 Rizky Indah Melly Silvi Fitriani Siti Laelatul Chasanah Sulistian Oskavina Tryo Romadhoni Pujakusuma Warsono Warsono Wisnu Wardhana Wisnu Wardhana Wiwin Susanty Yudi Antoni

Title

Found 48 Documents
Search

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title Search

Found 48 Documents Search

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title

Found 48 Documents
Search