Claim Missing Document
Check
Articles

Analysis Multivariate Time Series Using State Space Model for Forecasting Inflation in Some Sectors of Economy in Indonesia Edwin Russel; Wamiliana Wamiliana; Warsono; Nairobi; Mustofa Usman; Faiz AM Elfaki
Science and Technology Indonesia Vol. 8 No. 1 (2023): January
Publisher : Research Center of Inorganic Materials and Coordination Complexes, FMIPA Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26554/sti.2023.8.1.144-150

Abstract

Many analytical methods can be utilized for multivariate time series modeling. One of the analytical models for modeling time series data with multiple variables is the State Space Model. The data to be analyzed in this study is inflation data from expenditure groups such as processed foods, beverages, cigarettes, and tobacco; and housing inflation for water, electricity, gas, and fuel from January 2001 to December 2021. The aim is to determine the best State Space Model that fits the data for forecasting. In this study, the State Space method will be utilized further with multivariate time series data and represent State Space in Vector Autoregressive (VAR) to determine the relationship between groups of observed variables.
The Relationship of Multiset, Stirling Number, Bell Number, and Catalan Number Wamiliana; Attiya Yuliana; Fitriani
Science and Technology Indonesia Vol. 8 No. 2 (2023): April
Publisher : Research Center of Inorganic Materials and Coordination Complexes, FMIPA Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26554/sti.2023.8.2.330-337

Abstract

Catalan numbers is not as famous as Fibonacci numbers, however this number has own its beauty and arts. Catalan numbers was discovered by Ming Antu in 1730, however, this numbers is credited to Eugene Catalan when he was studying parentheses in 1838. Catalan numbers mostly occurs in counting or enumeration problems. The Catalan numbers can be defined in more than one forms, and the most famous form is Cn = 1/n+1(2nn). In this study we will discuss the multiset construction and the relationship of the results of Multiset with Stirling, Bell, and Catalan numbers.
Penyelesaian Persamaan Nonlinier Menggunakan Metode Modifikasi Potra-ptak Ismawati Ismawati; La Zakaria; Aang Nuryaman; Wamiliana Wamiliana
Jurnal Siger Matematika Vol 4, No 1 (2023): Jurnal Siger Matematika
Publisher : FMIPA Universitas Lampung

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

Abstract

Pada peneitian ini, metode Modifikasi Potra-ptak digunakan untuk menyelesaikan persamaan nonlinier. Matlab digunakan untuk menyelesaikan persamaan nonlinier secara komputasi. Terdapat lima contoh yang digunakan sebagai pembanding metode Modifikasi Potra-ptak dengan metode Newton dan metode Newton Ganda. Berdasarkan hasil percobaan metode ini memberikan solusi persamaan nonlinier yang menghampiri nilai eksaknya dengan galat lebih kecil dan dalam waktu yang relatif singkat dibandingkan metode Newton dan metode Newton Ganda.
Forecasting The Value of Indonesian Oil-Non-Oil and Gas Imported Using The Gated Recurrent Unit (GRU) Dian Kurniasari; Sulistian Oskavina; Wamiliana Wamiliana; Warsono Warsono
Indonesian Journal of Artificial Intelligence and Data Mining Vol 6, No 1 (2023): Maret 2023
Publisher : Universitas Islam Negeri Sultan Syarif Kasim Riau

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

Abstract

In Indonesia, various factors play a role in economic development. Oil-non-oil and gas imports are one of the main factors. However, the value of oil-non-oil and gas imports in Indonesia fluctuates monthly. Therefore, an appropriate method is required to monitor changes in the value of oil-non-oil and gas imports in Indonesia so that the government can make the right choices. This study uses the GRU method to estimate the amount of oil-non-oil and gas imports in Indonesia. The best model for forecasting over the next two years has an optimum structure of 32 GRU units, 16 batch sizes, and 100 epochs, with a dropout of 0.2 and uses 80% training data and 20% test data. The MAPE value obtained is 0.999955%, with an accuracy of 99.000044%. Forecast results suggest an improvement from June 2022 to July 2024.
Solving the Shortest Total Path Length Spanning Tree Problem Using the Modified Sollin and Modified Dijkstra Algorithms Wamiliana; Reni Permata Sari; Astri Reformasari; Jani Suparman; Akmal Junaidi
Science and Technology Indonesia Vol. 8 No. 4 (2023): October
Publisher : Research Center of Inorganic Materials and Coordination Complexes, FMIPA Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26554/sti.2023.8.4.684-690

Abstract

In a weighted connected graph, the shortest total path length spanning tree problem is a problem when we need to discover the spanning tree with the lowest total cost of all pairwise distances between its vertices. This problem is also known as the minimum routing cost spanning tree (MRCST). In this study, we will discuss the Modified Sollin and Modified Dijkstra Algorithms to solve that problem which implemented on 300 problems are complete graphs of orders 10 to 100 in increments of 10, where every order consists of 30 problems. The results show that the performance of the Modified Dijkstra and the Modified Sollin Algorithms are slightly similar. On orders 10, 20, 30, 60, and 80, the Modified Dijkstra Algorithm performs better than the Modified Sollin, however on orders 40, 50, 70, 90, and 100, the Modified Sollin performs better.
Penentuan Lintasan Terpendek Perjalanan Pengiriman Barang Menggunakan Algoritma Cheapest Insertion Heuristic (Studi Kasus PT. Indah Logistik Cargo Bandar Lampung) Ahya Shofa Ananda; Notiragayu Notiragayu; Wamiliana Wamiliana; Muslim Ansori
Jurnal EurekaMatika Vol 11, No 2 (2023): Jurnal Eurekamatika
Publisher : Universitas Pendidikan Indonesia (UPI)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.17509/jem.v11i2.63723

Abstract

The growth in the number of online shop members has caused the value of e-commerce transactions in Indonesia to increase. This resulted in increased distribution of goods at PT. Indah Logistik Cargo. One of the constraints at PT. Indah Logistik Cargo is inefficient routes the distribution of packages. Distribution problem at this delivery service company include the Traveling Salesman Problem (TSP), which can be solved using the Cheapest Insertion Heuristic (CIH) algorithm. In this paper, the solution is carried out manually and also utilizes the Python programming language to optimize the delivery service travel path. Factual data owned by PT. Indah Logistik Cargo states that the total distance for delivering goods is 51.600 meters. Meanwhile, based on the results of manual calculations using the CIH algorithm, a total distance of 51.550 meters was obtained, which is smaller by a difference of 50 meters from the factual data. Furthermore, the results of calculations using the Python programming obtained 47.150 meters, or a difference of 4.450 meters. Therefore, the use of the CIH algorithm is proven to provide a path with a smaller total distance traveled.Keywords: CIH Algorithm, Goods Delivery, Shortest Path.AbstrakPeningkatan jumlah anggota online shop membuat nilai transaksi e-commerce di Indonesia mengalami kenaikan. Hal ini mengakibatkan meningkatnya pendistribusian barang pada PT. Indah Logistik Cargo. Kendala pada PT. Indah Logistik Cargo adalah keterlambatan penyaluran paket ke para konsumen akibat jalur lintasan yang tidak efisien. Permasalahan pendistribusian pada perusahaan jasa pengiriman ini termasuk permasalahan Travelling Salesman Problem (TSP) yang dapat diselesaikan menggunakan Algoritma Cheapest Insertion Heuristic (CIH). Pada tulisan ini, penyelesaian masalah tersebut dilakukan secara manual dan juga menggunakan bahasa pemrograman Python. Data faktual yang dimiliki PT. Indah Logistik Cargo bahwa total jarak pengiriman barang yaitu 51.600 meter. Sementara, berdasarkan hasil perhitungan dengan algoritma CIH secara manual diperoleh total jarak 51.550 meter, yang lebih kecil dengan selisih 50 meter dari data faktual. Sedangkan, hasil perhitungan dengan bahasa pemrograman Python diperoleh 47.150 meter, atau mempunyai selisih 4.450 meter. Oleh karena itu, penggunaan algoritma CIH terbukti memberikan lintasan dengan total jarak tempuh yang lebih kecil.
Pelatihan Penguasaan dan Pemahaman Materi Olimpiade Matematika Bagi Siswa dan Guru SMAN 13 Bandar Lampung Muslim Ansori; Wamiliana Wamiliana; Dina Eka Nurvazly; Siti Laelatul Chasanah
Jurnal Pengabdian Kepada Masyarakat (JPKM) TABIKPUN Vol. 4 No. 3 (2023)
Publisher : Faculty of Mathematics and Natural Sciences - Universitas Lampung

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

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 SMA Negeri 13 Bandar Lampung diinisiasi untuk memberikan dukungan kepada guru-guru matematika dan para siswa di SMA tersebut. Metode yang digunakan dalam kegiatan ini meliputi 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 evaluasi yang dilakukan dari kegiatan ini menyimpulkan bahwa  pemahaman dan keterampilan guru-guru meningkat dalam membimbing siswa untuk menghadapi olimpiade matematika, seperti terlihat dari hasil peningkatan nilai pada post-test para siswa.
The Comparison of Dijsktra’s Algorithm and Flyod Warshall’s Algorithm to Determine The Shortest Path of Traditional Markets in Bandar Lampung City Poetri Hana Nurhandayani; Wamiliana Wamiliana; Misgiyati Misgiyati; Notiragayu Notiragayu; Muslim Ansori
Explore: Jurnal Sistem Informasi dan Telematika (Telekomunikasi, Multimedia dan Informatika) Vol 15, No 1 (2024): Juni
Publisher : Universitas Bandar Lampung (UBL)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.36448/jsit.v15i1.3714

Abstract

Determining the shortest path between one location to another location is one of the problems that usually has to be faced in daily life. The shortest path will affect the shorter time needed, less money used, and others. In this study, we will discuss the comparison of Dijsktra’s Algorithm and Floyd Warshal’s Algorithm to determine the shortest path of the biggest and the most famous traditional market in Bandar Lampung City, which is Bambu Kuning traditional market, to 26 other traditional markets in Bandar Lampung city. The Phyton programming language is used to implement both algorithms on the data of 27 traditional markets. The results show that both algorithms give the same solution. However, the processing time of Dijsktra’s Algorithm (0.1063 seconds) is faster than Floyd Warshal’s algorithm (0.1691 seconds)
Pembangunan Sistem Operasi Berbasis Linux Menggunakan Metode Linux From Scratch Wamiliana Wamiliana; Fahmi Kharismaldie; Wisnu Wardhana
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.553

Abstract

GNU/Linux is an operating system that allows the users to build or develop their own operating system. There are two methods that can be used, Remaster and Linux From Scratch. The difference is the LFS method builds a system from zero while Remaster using existing Linux distributions [4]. The goal of this research is to investigate the steps of building Linux base operating system using LFS method. The operating system has been built successfully and can be used to fulfill the daily needs such as playing music or video, browsing, programming, and other tasks.Keywords: GNU/Linux, Linux From Scratch, open source, operating system
SIMULASI SISTEM PENGATURAN LALU LINTAS OTOMATIS DENGAN KARAKTERISTIK KERAPATAN PADA SIMPANG TIGA DAN SIMPANG EMPAT MENGGUNAKAN ALGORITMA MILOZA Wamiliana Wamiliana; Izzatuz Zakiyah Mukhtarisa; 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.546

Abstract

Nowadays, the traffic control system already done computerized. However, usually the system is set without considering density of the changing vehicles. In this research, an algorithm developed to solve the problem of traffic control is still constant and manual (fixed time traffic). The algorithm is called Miloza algorithm. Miloza algorithm is an algorithm used to find the optimum solution of traffic control based on density characteristics of the vehicle. The purpose of this research is to make a simulation of automatic control system for traffic light with density characteristics at the three and four junctions using MilozaAlgorithm as an alternative solution. The simulation application is made using visual basic programming language and the method of application development used is prototype method.Keywords: traffic control, algorithm, simulation
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