Wamiliana Wamiliana
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Wamiliana Wamiliana has a total of 65 co-authors. Here are the top co-authors by number of shared publications:
- Dedi Darwis
Faculty of Engineering and Computer Science, Universitas Teknokrat Indonesia, Indonesia
4 shared publications Mustofa Usman
Department of Mathematics, Faculty of Mathematics and Sciences, Universitas Lampung, Bandar Lampung, 35141, Indonesia
4 shared publicationsAkmal Junaidi
Department of Computer Science, Faculty of Mathematics and Natural Science, Universitas Lampung, Bandar Lampung, 35145, Indonesia
3 shared publicationsFitriani Fitriani
Department of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Lampung
3 shared publicationsMuslim Ansori
Universitas Lampung
3 shared publicationsWarsono Warsono
3 shared publications
Latest Publications
- Open Access
- 13 March 2026
- Published by ARTS Publishing in Science and Technology Indonesia
- Vol. 11  (2) , 750-757
The Relation of Tribinomial Coefficients with Triangular, Catalan and Mersenne Number
Numbers are inseparable from mathematics. Each of these types of numbers has its own distinct definition and properties. Numbers are not only used in mathematics, but are also essential in other fields such as philosophy, technology, and science. Tribinomial coefficients, Catalan numbers, and Mersenne numbers are three types of numbers that has their own uniqueness and beauty. Tribinomial coefficients derived from triangular number using similar definition for binomial coefficients. Triangular numbers constitute a class of figurative numbers derived from the systematic arrangement of discrete units (such as dots) into the geometric configuration of an equilateral triangle. The Catalan numbers constitute a sequence of positive integers that emerge in numerous combinatorial enumeration problems. Formally, the n-th Catalan number is defined by the closed-form expression: $C_n = \frac{1}{n+1} \binom{2n}{n}= \frac{(2n)!}{(n+1)!n!}, n \in N$. Mersenne numbers are the numbers known in mathematics that also have their own beauty and uniqueness. When represented using binary, all Mersenne numbers are repeating 1s. The first eight Mersenne numbers are 1, 3, 7, 15, 31, 63, 127, 255, which are represented in binary as 1, 11, 111, 1111, 11111, 111111, 1111111, 11111111. In this study the relationship of Tribinomial coefficients with Catalan and Marsenne numbers will be disccused.- 13 March 2026
- Published by ARTS Publishing in Science and Technology Indonesia
- Vol. 11  (2) , 750-757
Open AccessThe Relation of Tribinomial Coefficients with Triangular, Catalan and Mersenne Number
Numbers are inseparable from mathematics. Each of these types of numbers has its own distinct definition and properties. Numbers are not only used in mathematics, but are also essential in other fields such as philosophy, technology, and science. Tribinomial coefficients, Catalan numbers, and Mersenne numbers are three types of numbers that has their own uniqueness and beauty. Tribinomial coefficients derived from triangular number using similar definition for binomial coefficients. Triangular numbers constitute a class of figurative numbers derived from the systematic arrangement of discrete units (such as dots) into the geometric configuration of an equilateral triangle. The Catalan numbers constitute a sequence of positive integers that emerge in numerous combinatorial enumeration problems. Formally, the n-th Catalan number is defined by the closed-form expression: $C_n = \frac{1}{n+1} \binom{2n}{n}= \frac{(2n)!}{(n+1)!n!}, n \in N$. Mersenne numbers are the numbers known in mathematics that also have their own beauty and uniqueness. When represented using binary, all Mersenne numbers are repeating 1s. The first eight Mersenne numbers are 1, 3, 7, 15, 31, 63, 127, 255, which are represented in binary as 1, 11, 111, 1111, 11111, 111111, 1111111, 11111111. In this study the relationship of Tribinomial coefficients with Catalan and Marsenne numbers will be disccused. - Open Access
- 30 October 2025
- Published by Lembaga Penelitian dan Pengabdian kepada Masyarakat Universitas Lampung in jurnal komputasi
- Vol. 13  (2) , 170-178
Comparison of the Cheapest Insertion Heuristic Algorithm, Christofides Algorithm, and Nearest Neighbor Algorithm for Determining Hospital Tours in Bandar Lampung City
Determining the optimal route is one of the important aspects in planning the distribution of health services, especially in emergency conditions in Bandar Lampung City. This study compares three algorithms for solving tour problems, namely Cheapest Insertion Heuristic, Nearest Neighbor (NN), and Christofides Algorithm, in determining the fastest tour to a number of hospitals. Calculations were performed manually and also implemented using the Python programming language. The results obtained show that manually and using Python programming, the Cheapest Insertion Heuristic algorithm produced 152 minutes, the Nearest Neighbour algorithm 142 minutes, and the Christofides Algorithm 147 minutes.
- 30 October 2025
- Published by Lembaga Penelitian dan Pengabdian kepada Masyarakat Universitas Lampung in jurnal komputasi
- Vol. 13  (2) , 170-178
Open AccessComparison of the Cheapest Insertion Heuristic Algorithm, Christofides Algorithm, and Nearest Neighbor Algorithm for Determining Hospital Tours in Bandar Lampung City
Determining the optimal route is one of the important aspects in planning the distribution of health services, especially in emergency conditions in Bandar Lampung City. This study compares three algorithms for solving tour problems, namely Cheapest Insertion Heuristic, Nearest Neighbor (NN), and Christofides Algorithm, in determining the fastest tour to a number of hospitals. Calculations were performed manually and also implemented using the Python programming language. The results obtained show that manually and using Python programming, the Cheapest Insertion Heuristic algorithm produced 152 minutes, the Nearest Neighbour algorithm 142 minutes, and the Christofides Algorithm 147 minutes.
- Open Access
- 6 October 2025
- Published by Engineering, Technology & Applied Science Research in Engineering, Technology & Applied Science Research
- Vol. 15  (5) , 27076-27088
Metadata-Based Video Steganography: Development of a New Model for Secure Information Embedding
This study introduces a novel video steganography model called Video Steganography Technique in Metadata (VSTM), which embeds secret messages within the metadata of MP4 video files. By utilizing the 'comments' field in the metadata, the method ensures that the visual and audio quality of the video remains unaffected. This model offers original contributions in maintaining the integrity and resilience of digital data against common manipulations, such as cropping, rotation, and social media compression. The VSTM model combines the Advanced Encryption Standard (AES) for encryption and ZLIB for data compression, enhancing the security and optimizing the data size. The tests demonstrate that the VSTM model maintains perfect video fidelity with no detectable pixel changes and achieves a high level of robustness against various manipulations, including video cropping, rotation, resizing, and sharing through most social media platforms. The test results showed that the VSTM was able to maintain the integrity of the video files, had resistance to visible detection, and was effectively used for small-scale confidential communications. This model offers a practical and secure solution in the field of digital steganography, and has the potential to be applied to a wide range of data protection needs in sensitive digital environments. However, metadata stripping by certain platforms, such as Instagram, affects the message retrieval. The method proves effective and reliable in securing digital information within the video files while preserving quality and ensuring the message integrity.
- 6 October 2025
- Published by Engineering, Technology & Applied Science Research in Engineering, Technology & Applied Science Research
- Vol. 15  (5) , 27076-27088
Open AccessMetadata-Based Video Steganography: Development of a New Model for Secure Information Embedding
This study introduces a novel video steganography model called Video Steganography Technique in Metadata (VSTM), which embeds secret messages within the metadata of MP4 video files. By utilizing the 'comments' field in the metadata, the method ensures that the visual and audio quality of the video remains unaffected. This model offers original contributions in maintaining the integrity and resilience of digital data against common manipulations, such as cropping, rotation, and social media compression. The VSTM model combines the Advanced Encryption Standard (AES) for encryption and ZLIB for data compression, enhancing the security and optimizing the data size. The tests demonstrate that the VSTM model maintains perfect video fidelity with no detectable pixel changes and achieves a high level of robustness against various manipulations, including video cropping, rotation, resizing, and sharing through most social media platforms. The test results showed that the VSTM was able to maintain the integrity of the video files, had resistance to visible detection, and was effectively used for small-scale confidential communications. This model offers a practical and secure solution in the field of digital steganography, and has the potential to be applied to a wide range of data protection needs in sensitive digital environments. However, metadata stripping by certain platforms, such as Instagram, affects the message retrieval. The method proves effective and reliable in securing digital information within the video files while preserving quality and ensuring the message integrity.
- Open Access
- 13 May 2025
- Published by Universitas Bandar Lampung in Jurnal Pengabdian Masyarakat Tapis Berseri (JPMTB)
- Vol. 4  (1) , 7-12
Pelatihan Pembuatan Infografis Desa dalam Rangka Mendukung Program Desa Cantik
Program Desa Cinta Statistik atau disingkat Desa Cantik merupakan salah satu program Badan Pusat Statistik (BPS) guna mewujudkan pembinaan statistik sektoral di tingkat desa secara berkesinambungan dan komprehensif. BPS Kabupaten Tanggamus merupakan salah satu BPS yang ikut berpartisipasi dalam membina desa cantik. Pada tahun 2024 ini, BPS Tanggamus membina 4 pekon/desa yang tersebar di wilayah Kabupaten Tanggamus. Empat pekon/desa tersebut adalah Kampung Baru, Kagungan, Purwodadi dan Banding Agung. Tujuan pembinaan ini adalah untuk meningkatkan kapasitas pekon/desa atau kemudahan dalam mengidentifikasi kebutuhan data dan potensi yang dimiliki oleh desa dalam rangka pengentasan kemiskinan dan meningkatkan literasi statistik di pekon/desa. Sejalan dengan tanggung jawab yang diemban oleh BPS terkait program Desa Cantik ini, pembinaan tersebut juga menjadi tantangan bagi staf Jurusan Matematika FMIPA Unila untuk berpartisipasi dalam mentransfer pengetahuan dan keterampilan khususnya terkait Teknik Statistika. Melalui program ini, sumber daya manusia di pekon/desa dilatih mengolah data monografi kelurahan dan menyajikannya dalam bentuk infografis dengan bantuan aplikasi Tableu dan Canva. Hasil kegiatan pelatihan ini menunjukkan 71% peserta telah berpartisipasi secara aktif dalam penyusunan infografis
- 13 May 2025
- Published by Universitas Bandar Lampung in Jurnal Pengabdian Masyarakat Tapis Berseri (JPMTB)
- Vol. 4  (1) , 7-12
Open AccessPelatihan Pembuatan Infografis Desa dalam Rangka Mendukung Program Desa Cantik
Program Desa Cinta Statistik atau disingkat Desa Cantik merupakan salah satu program Badan Pusat Statistik (BPS) guna mewujudkan pembinaan statistik sektoral di tingkat desa secara berkesinambungan dan komprehensif. BPS Kabupaten Tanggamus merupakan salah satu BPS yang ikut berpartisipasi dalam membina desa cantik. Pada tahun 2024 ini, BPS Tanggamus membina 4 pekon/desa yang tersebar di wilayah Kabupaten Tanggamus. Empat pekon/desa tersebut adalah Kampung Baru, Kagungan, Purwodadi dan Banding Agung. Tujuan pembinaan ini adalah untuk meningkatkan kapasitas pekon/desa atau kemudahan dalam mengidentifikasi kebutuhan data dan potensi yang dimiliki oleh desa dalam rangka pengentasan kemiskinan dan meningkatkan literasi statistik di pekon/desa. Sejalan dengan tanggung jawab yang diemban oleh BPS terkait program Desa Cantik ini, pembinaan tersebut juga menjadi tantangan bagi staf Jurusan Matematika FMIPA Unila untuk berpartisipasi dalam mentransfer pengetahuan dan keterampilan khususnya terkait Teknik Statistika. Melalui program ini, sumber daya manusia di pekon/desa dilatih mengolah data monografi kelurahan dan menyajikannya dalam bentuk infografis dengan bantuan aplikasi Tableu dan Canva. Hasil kegiatan pelatihan ini menunjukkan 71% peserta telah berpartisipasi secara aktif dalam penyusunan infografis
- Open Access
- 15 April 2025
- Published by Lembaga Penelitian dan Pengabdian kepada Masyarakat Universitas Lampung in Jurnal Pepadun
- Vol. 6  (1) , 92-102
Determining the Shortest Tour Location of Tourist Attractions in Bandar Lampung Using Cheapest Insertion Heuristic (CIH) and Modified Sollin Algorithm
The travel and tourism industry play important role in economics. Like various urban areas on the island of Sumatra which is famous for its tourist destinations, the city of Bandar Lampung is one of the tourist destinations for urban communities on the island of Sumatra because it has many cultural tourist attractions that tourists can visit. With so many choices of tourist destinations, tourists will definitely think about considering the time and costs as efficiently as possible to visit the available tourist attractions. Therefore, it is necessary to take the shortest tour so that it can save time and costs. This problem is known as the Traveling Salesman Problem (TSP). In this study the Cheapest Insertion Heuristic and Modified Sollin Algorithm are used to solve the problem. The results obtained show that the solution using the modified Sollin Algorithm is better than the Cheapest Insertion Heuristic.
- 15 April 2025
- Published by Lembaga Penelitian dan Pengabdian kepada Masyarakat Universitas Lampung in Jurnal Pepadun
- Vol. 6  (1) , 92-102
Open AccessDetermining the Shortest Tour Location of Tourist Attractions in Bandar Lampung Using Cheapest Insertion Heuristic (CIH) and Modified Sollin Algorithm
The travel and tourism industry play important role in economics. Like various urban areas on the island of Sumatra which is famous for its tourist destinations, the city of Bandar Lampung is one of the tourist destinations for urban communities on the island of Sumatra because it has many cultural tourist attractions that tourists can visit. With so many choices of tourist destinations, tourists will definitely think about considering the time and costs as efficiently as possible to visit the available tourist attractions. Therefore, it is necessary to take the shortest tour so that it can save time and costs. This problem is known as the Traveling Salesman Problem (TSP). In this study the Cheapest Insertion Heuristic and Modified Sollin Algorithm are used to solve the problem. The results obtained show that the solution using the modified Sollin Algorithm is better than the Cheapest Insertion Heuristic.
- Open Access
- 1 October 2024
- Published by ARTS Publishing in Science and Technology Indonesia
- Vol. 9  (4) , 999-1008
The Use of Probability and Edge Analysis to Solve the Multi-Period Degree Constrained Minimum Spanning Tree Problem
The goal of the Multiperiod Degree Constrained Minimum Spanning Tree (MPDCMST) problem is to determine the smallest weight-spanning tree that satisfies the vertex installation criterion for each period and maintains the degree requirement in each vertex. This issue emerges as a network connection problem. The degree requirement indicates the reliability of each vertex, and the vertex connection/installation requirement denotes the priority vertices that must be inserted in the network within a specific time frame. The installation is split up into multiple phases/stages. This is because of various considerations such as severe weather, budgetary limitations, etc. In this research, two algorithms for solving the MPDCMST using probability hybridized with Prim’s modification, and edge analysis are proposed. The algorithms are implemented on the undirected complete graph of orders 10 to 100. The solutions are compared with some heuristics which are already in the literature. The results show that the proposed algorithms perform better.
- 1 October 2024
- Published by ARTS Publishing in Science and Technology Indonesia
- Vol. 9  (4) , 999-1008
Open AccessThe Use of Probability and Edge Analysis to Solve the Multi-Period Degree Constrained Minimum Spanning Tree Problem
The goal of the Multiperiod Degree Constrained Minimum Spanning Tree (MPDCMST) problem is to determine the smallest weight-spanning tree that satisfies the vertex installation criterion for each period and maintains the degree requirement in each vertex. This issue emerges as a network connection problem. The degree requirement indicates the reliability of each vertex, and the vertex connection/installation requirement denotes the priority vertices that must be inserted in the network within a specific time frame. The installation is split up into multiple phases/stages. This is because of various considerations such as severe weather, budgetary limitations, etc. In this research, two algorithms for solving the MPDCMST using probability hybridized with Prim’s modification, and edge analysis are proposed. The algorithms are implemented on the undirected complete graph of orders 10 to 100. The solutions are compared with some heuristics which are already in the literature. The results show that the proposed algorithms perform better.
- Open Access
- 28 June 2024
- Published by Universitas Airlangga in Journal of Information Systems Engineering and Business Intelligence
- Vol. 10  (2) , 217-231
Text Stemming and Lemmatization of Regional Languages in Indonesia: A Systematic Literature Review
Background: Stemming is significantly essential in natural language processing (NLP) due to the ability to minimize word variations to fundamental forms. This procedure facilitates the analysis of textual data and enhances the precision of classification and information retrieval. Objective: Previous related systematic literature review has not been conducted on stemming and lemmatization in regional languages in Indonesia. Therefore, this study aims to conduct a systematic literature review to capture the latest developments in stemming and lemmatization in regional languages in Indonesia. Methods: This study was carried out using Kitchenham method, analyzing 35 studies extracted from 740, which were obtained from Scopus, IEEE Xplore, and Google Scholar, and published between 2014 and 2023. Results: The results showed that study trends in stemming possessed the potential to continue developing every year. Additionally, the main element in stemming and lemmatization studies was found to be the availability of digital dictionaries in regional languages. This was because greater number of basic vocabularies contributed more positively to stemming or lemmatization. The availability of word morphology information in regional languages would be constructive for making rule-based stemmers. Meanwhile, corpus-based stemming and lemmatization studies could only be conducted for languages with a large corpus to ensure there were various affixed words to process. Conclusion: Based on SLR study, stemming and lemmatization in regional languages in Indonesia developed significantly from 2014 to 2023. The two main strategies applied included using available digital dictionaries and language morphology information. However, the main challenges encountered were the limited number of vocabulary words in the dictionaries and testing various rule-based methods. Keywords: Lemmatization, Morphology, Rule-based, Stemming, Systematic Literature Review.
- 28 June 2024
- Published by Universitas Airlangga in Journal of Information Systems Engineering and Business Intelligence
- Vol. 10  (2) , 217-231
Open AccessText Stemming and Lemmatization of Regional Languages in Indonesia: A Systematic Literature Review
Background: Stemming is significantly essential in natural language processing (NLP) due to the ability to minimize word variations to fundamental forms. This procedure facilitates the analysis of textual data and enhances the precision of classification and information retrieval. Objective: Previous related systematic literature review has not been conducted on stemming and lemmatization in regional languages in Indonesia. Therefore, this study aims to conduct a systematic literature review to capture the latest developments in stemming and lemmatization in regional languages in Indonesia. Methods: This study was carried out using Kitchenham method, analyzing 35 studies extracted from 740, which were obtained from Scopus, IEEE Xplore, and Google Scholar, and published between 2014 and 2023. Results: The results showed that study trends in stemming possessed the potential to continue developing every year. Additionally, the main element in stemming and lemmatization studies was found to be the availability of digital dictionaries in regional languages. This was because greater number of basic vocabularies contributed more positively to stemming or lemmatization. The availability of word morphology information in regional languages would be constructive for making rule-based stemmers. Meanwhile, corpus-based stemming and lemmatization studies could only be conducted for languages with a large corpus to ensure there were various affixed words to process. Conclusion: Based on SLR study, stemming and lemmatization in regional languages in Indonesia developed significantly from 2014 to 2023. The two main strategies applied included using available digital dictionaries and language morphology information. However, the main challenges encountered were the limited number of vocabulary words in the dictionaries and testing various rule-based methods. Keywords: Lemmatization, Morphology, Rule-based, Stemming, Systematic Literature Review.
- 1 January 2024
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 2970  (1) , 030015
The number of disconnected order six graphs labeled vertices without loops and contain odd number of pair of vertices connected by parallel edges
A disconnected graph G is a graph that consists of two or more components. A connected graph G is one where every vertex in G has a path leading to every other A disconnected graph G is a graph that consists of two or more components. A connected graph G is one where every vertex in G has a path leading to every other
- 1 January 2024
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 2970  (1) , 030015
The number of disconnected order six graphs labeled vertices without loops and contain odd number of pair of vertices connected by parallel edges
A disconnected graph G is a graph that consists of two or more components. A connected graph G is one where every vertex in G has a path leading to every other A disconnected graph G is a graph that consists of two or more components. A connected graph G is one where every vertex in G has a path leading to every other
- Open Access
- 1 October 2023
- Published by ARTS Publishing in Science and Technology Indonesia
- Vol. 8  (4) , 684-690
Solving the Shortest Total Path Length Spanning Tree Problem Using the Modified Sollin and Modified Dijkstra Algorithms
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.
- 1 October 2023
- Published by ARTS Publishing in Science and Technology Indonesia
- Vol. 8  (4) , 684-690
Open AccessSolving the Shortest Total Path Length Spanning Tree Problem Using the Modified Sollin and Modified Dijkstra Algorithms
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.
- Open Access
- 1 August 2023
- Published by Lembaga Penelitian dan Pengabdian kepada Masyarakat Universitas Lampung in Jurnal Pepadun
- Vol. 4  (2) , 183-190
Perbandingan Algoritme Dijkstra dan Algoritme A* (A-Star) dalam Penentuan Lintasan Terpendek dari Dinas Pendidikan Provinsi Lampung ke Beberapa Sekolah Menengah Atas (SMA) Negeri di Provinsi Lampung
In this research, we aim to find the most efficient route from the Lampung Provincial Education Office to various State Senior High Schools in Lampung Province, employing both the Dijkstra Algorithm and the A* (A-Star) Algorithm. To address this problem, we model it as a weighted graph, where the vertices represent the locations of the Lampung Provincial Education Office and the Public High Schools, and the edges' weights represent the distances. Furthermore, we implement the solution using the Python programming language. The outcomes demonstrate that both algorithms yield optimal results with the same distance and route. However, when considering the execution time of the program, the A* (A-Star) algorithm outperforms Dijkstra's Algorithm because it quickly identifies the shortest path from the starting point to the destination, whereas Dijkstra's Algorithm explores the shortest paths from neighboring points first.
- 1 August 2023
- Published by Lembaga Penelitian dan Pengabdian kepada Masyarakat Universitas Lampung in Jurnal Pepadun
- Vol. 4  (2) , 183-190
Open AccessPerbandingan Algoritme Dijkstra dan Algoritme A* (A-Star) dalam Penentuan Lintasan Terpendek dari Dinas Pendidikan Provinsi Lampung ke Beberapa Sekolah Menengah Atas (SMA) Negeri di Provinsi Lampung
In this research, we aim to find the most efficient route from the Lampung Provincial Education Office to various State Senior High Schools in Lampung Province, employing both the Dijkstra Algorithm and the A* (A-Star) Algorithm. To address this problem, we model it as a weighted graph, where the vertices represent the locations of the Lampung Provincial Education Office and the Public High Schools, and the edges' weights represent the distances. Furthermore, we implement the solution using the Python programming language. The outcomes demonstrate that both algorithms yield optimal results with the same distance and route. However, when considering the execution time of the program, the A* (A-Star) algorithm outperforms Dijkstra's Algorithm because it quickly identifies the shortest path from the starting point to the destination, whereas Dijkstra's Algorithm explores the shortest paths from neighboring points first.