Article Per Year (5 Year)
p-Index From 2020 - 2025
1.745
P-Index
This Author published in this journals
All Journal Desimal: Jurnal Matematika Cyberspace: Jurnal Pendidikan Teknologi Informasi JTAM (Jurnal Teori dan Aplikasi Matematika) Jurnal Natural J-SIGN (Journal Of Informatics, Information System, And Artificial Intelligence)
Mahyus Ihsan
Universitas Syiah Kuala
Agriculture, Biological Sciences & Forestry Astronomy Biochemistry, Genetics & Molecular Biology Chemistry Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Earth & Planetary Sciences Education Energy Immunology & microbiology Mathematics Neuroscience Physics Social Sciences Other

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

Found 11 Documents
Search

 1   2 
IDENTIFY CONNECTIVITY GRAPH USING A MODIFIED PRÜFER’S ALGORITHM LABELLING TREES Al Aiyub; Mahyus Ihsan; Rahma Zuhra
Jurnal Natural Volume 13, Number 1, March 2013
Publisher : Universitas Syiah Kuala

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

Abstract

Connectivity of graph easily can be given when we see it with the bare of eyes, but needs an algorithm that can assure the connectivity in computerization. Some graphs require the connectivity in their definitions, such as Hamiltonian graph, Eulerian graph and tree. The connectivity become important in order to solve any of graphs' problems by using computer technology. Most of the algorithm cannot run perfectly, if the graph which is given was not connected. It is happened to Djikstra and Prufer graphs for example. However, this study will provide the solution by modifying Prufer algorithm to show the connectivity in the graph.
Connectivity Algorithm in Simple Graphs Reza Wafdan; Mahyus Ihsan; Rahmah Zuhra
Jurnal Natural Volume 14, Number 1, March 2014
Publisher : Universitas Syiah Kuala

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

Abstract

This paper discusses about connectivity algorithm in simple graphs. The algorithm has three stages, namely, adjacent vertices search, adjacent vertices investigation and component investigation. The aim of connectivity algorithm is to check whether a graph is connected or disconnected with the scope set. There are three sets which are used in this algorithm, namely, vertex, edge and adjacent vertices sets. The simple graph is connected if the graph has only one component or if the number of adjacent vertices elements is equal to the number of vertices. Otherwise, if the simple graph has more than one component or if the number of adjacent vertices elements is not equal to the number of vertices then the algorithm will conclude that the graph is disconnected.
SOLUSI PERMASALAHAN KOMPUTASI SKALA BESAR PADA SOFTWARE ADOBE FLASH DALAM PERANCANGAN MEDIA PEMBELAJARAN PENCARIAN EULERIAN CIRCUIT Reza Wafdan; Mahyus Ihsan; Marwan Ramli; Hafnani Hafnani
Jurnal Natural Volume 16, Number 1, March 2016
Publisher : Universitas Syiah Kuala

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (236.963 KB) | DOI: 10.24815/jn.v16i1.4641

Abstract

Adobe Flash is a software that is used to build an interactive contents that can be attached in other things, such as presentations, games and e-learning. The Eulerian Circuit Search Instructional Media is one of examples in using Adobe Flash in building an interactive instructional media to solve graph theory problems. Visually, Adobe Flash is better than other programming software in general and it is the most suitable one for graph theory, as it uses graphics and visuals to solve problems. The weakness of Adobe Flash is when doing large scale calculations; such as when testing algorithms to find Eulerian circuits. Then an idea came about to complete the large scale calculations in Adobe Flash, which is commonly known as script time limit, with using other methodologies by changing script time limit on the settings, algorithms, partition the processes, and utulize the timers within the objects in the actionscript that handles the search algorithms of searching Eulerian circuit.
Non-perfect maze generation using Kruskal algorithm MAHYUS IHSAN; DEDI SUHAIMI; MARWAN RAMLI; SYARIFAH MEURAH YUNI; IKHSAN MAULIDI
Jurnal Natural Volume 21 Number 1, February 2021
Publisher : Universitas Syiah Kuala

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (404.942 KB) | DOI: 10.24815/jn.v21i1.18840

Abstract

A non-perfect maze is a maze that contains loop or cycle and has no isolated cell. A non-perfect maze is an alternative to obtain a maze that cannot be satisfied by perfect maze. This paper discusses non-perfect maze generation with two kind of biases, that is, horizontal and vertical wall bias and cycle bias. In this research, a maze is modeled as a graph in order to generate non-perfect maze using Kruskal algorithm modifications. The modified Kruskal algorithm used Fisher Yates algorithm to obtain a random edge sequence and disjoint set data structure to reduce process time of the algorithm. The modification mentioned above are adding edges randomly while taking account of the edge’s orientation, and by adding additional edges after spanning tree is formed. The algorithm designed in this research constructs an  non-perfect maze with complexity of  where  and  denote vertex and edge set of an  grid graph, respectively. Several biased non-perfect mazes were shown in this research by varying its dimension, wall bias and cycle bias.
Non-perfect maze generation using Kruskal algorithm MAHYUS IHSAN; DEDI SUHAIMI; MARWAN RAMLI; SYARIFAH MEURAH YUNI; IKHSAN MAULIDI
Jurnal Natural Volume 21 Number 1, February 2021
Publisher : Universitas Syiah Kuala

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24815/jn.v21i1.18840

Abstract

A non-perfect maze is a maze that contains loop or cycle and has no isolated cell. A non-perfect maze is an alternative to obtain a maze that cannot be satisfied by perfect maze. This paper discusses non-perfect maze generation with two kind of biases, that is, horizontal and vertical wall bias and cycle bias. In this research, a maze is modeled as a graph in order to generate non-perfect maze using Kruskal algorithm modifications. The modified Kruskal algorithm used Fisher Yates algorithm to obtain a random edge sequence and disjoint set data structure to reduce process time of the algorithm. The modification mentioned above are adding edges randomly while taking account of the edge’s orientation, and by adding additional edges after spanning tree is formed. The algorithm designed in this research constructs an  non-perfect maze with complexity of  where  and  denote vertex and edge set of an  grid graph, respectively. Several biased non-perfect mazes were shown in this research by varying its dimension, wall bias and cycle bias.
SOLUSI PERMASALAHAN KOMPUTASI SKALA BESAR PADA SOFTWARE ADOBE FLASH DALAM PERANCANGAN MEDIA PEMBELAJARAN PENCARIAN EULERIAN CIRCUIT Reza Wafdan; Mahyus Ihsan; Marwan Ramli; Hafnani Hafnani
Jurnal Natural Volume 16, Number 1, March 2016
Publisher : Universitas Syiah Kuala

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24815/jn.v16i1.4641

Abstract

Adobe Flash is a software that is used to build an interactive contents that can be attached in other things, such as presentations, games and e-learning. The Eulerian Circuit Search Instructional Media is one of examples in using Adobe Flash in building an interactive instructional media to solve graph theory problems. Visually, Adobe Flash is better than other programming software in general and it is the most suitable one for graph theory, as it uses graphics and visuals to solve problems. The weakness of Adobe Flash is when doing large scale calculations; such as when testing algorithms to find Eulerian circuits. Then an idea came about to complete the large scale calculations in Adobe Flash, which is commonly known as script time limit, with using other methodologies by changing script time limit on the settings, algorithms, partition the processes, and utulize the timers within the objects in the actionscript that handles the search algorithms of searching Eulerian circuit.
Pengembangan Website Informasi Diploma 3 Manajemen Informatika Menggunakan Framework Laravel Ihsan, Mahyus; Rahmadsyah, Rizki; Husaini, Husaini
J-SIGN (Journal of Informatics, Information System, and Artificial Intelligence) Vol 2, No 02 (2024): November
Publisher : Department of Informatics, Universitas Syiah Kuala

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24815/j-sign.v2i02.38290

Abstract

Penggunaan situs web informasi akademik sangat penting untuk semua program studi di Universitas Syiah Kuala, termasuk Program Studi Diploma 3 Manajemen Informatika (PSMI). Situs web Informasi Akademik tidak hanya membantu dalam dokumentasi, tetapi juga menyediakan berita yang akurat dan terbaru. Namun, sistem informasi akademik PSMI saat ini memiliki beberapa masalah seperti fitur manajemen konten yang terbatas, tidak responsif, ketidakcocokan dengan berbagai perangkat, kurangnya manajemen situs web, dan tidak adanya integrasi dengan platform media sosial. Untuk mengatasi masalah ini, penelitian ini bertujuan mengembangkan situs web informasi akademik yang kaya fitur dan responsif menggunakan kerangka kerja Laravel. Proses pengembangan mengikuti model waterfall, yang meliputi tahapan analisis kebutuhan, desain, implementasi, dan pengujian. Koordinasi dengan koordinator program, staf administrasi, dan mahasiswa sangat penting sela-ma tahap analisis kebutuhan dan desain. Situs web baru ini mencakup fitur-fitur yang meningkatkan mana-jemen konten dan memastikan kompatibilitas dengan berbagai perangkat. Hasil pengujian, termasuk pengujian responsif dan black box, menunjukkan bahwa situs web berfungsi dengan baik. Akhirnya, situs web baru ini di-harapkan dapat meningkatkan efisiensi dan efektivitas manajemen informasi akademik di PSMI.
PENERAPAN HIERARKI CERTIFICATE AUTHORITY DAN PUBLIC KEY INFRASTRUCTURE UNTUK MEMPERKUAT KEAMANAN JARINGAN Husaini, Husaini; Ramadhan, Teuku Hafiez; Ihsan, Mahyus
CYBERSPACE: Jurnal Pendidikan Teknologi Informasi Vol 9, No 1 (2025)
Publisher : UIN Ar-Raniry

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22373/cj.v9i1.27159

Abstract

Dewasa ini, keamanan jaringan telah menjadi semakin krusial terutama dalam lingkungan bisnis yang saling terhubung secara global. Komunikasi antara kantor cabang dan kantor pusat melalui jaringan global memunculkan risiko seperti pencurian data, pengawasan, dan serangan siber. Hal ini tentu akan menjadi ancaman yang nyata terhadap kerahasiaan dan integritas informasi sensitif perusahaan. Untuk mengurangi risiko ini, penelitian ini mengusulkan implementasi sistem hierarki Certificate Authority (CA) dan Public Key Infrastructure (PKI) dengan memanfaatkan kunci asimetris untuk meningkatkan keamanan. Sistem hierarki CA memastikan langkah-langkah keamanan yang kuat melalui praktik manajemen kunci yang efektif. Tujuan utama dari penelitian ini adalah untuk meningkatkan keamanan jaringan dengan melindungi komunikasi antara kantor cabang dan kantor pusat menggunakan Site-to-Site Virtual Private Network (VPN) yang diimplementasikan dengan teknologi OpenVPN. Pendekatan komprehensif ini melibatkan berbagai metodologi, termasuk simulasi Graphical Network Simulator-3 (GNS3) untuk pengujian arsitektur jaringan, evaluasi ketat terhadap keamanan sertifikat digital, pemantauan lalu lintas yang berkelanjutan, pengujian kinerja jaringan secara menyeluruh, dan protokol keamanan server yang teliti. Hasil yang diharapkan dari penelitian ini diharapkan dapat memberikan wawasan berharga bagi organisasi yang bertujuan untuk mengurangi risiko keamanan jaringan secara efektif. Selain itu, temuan penelitian ini diharapkan dapat memberikan kontribusi signifikan terhadap pengembangan kerangka kerja keamanan jaringan yang disesuaikan dengan kebutuhan lingkungan bisnis yang terhubung secara global.
The Numerical Simulation for Asymptotic Normality of the Intensity Obtained as a Product of a Periodic Function with the Power Trend Function of a Nonhomogeneous Poisson Process Maulidi, Ikhsan; Ihsan, Mahyus; Apriliani, Vina
Desimal: Jurnal Matematika Vol. 3 No. 3 (2020): Desimal: Jurnal Matematika
Publisher : Universitas Islam Negeri Raden Intan Lampung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24042/djm.v3i3.6374

Abstract

In this article, we provided a numerical simulation for asymptotic normality of a kernel type estimator for the intensity obtained as a product of a periodic function with the power trend function of a nonhomogeneous Poisson Process. The aim of this simulation is to observe how convergence the variance and bias of the estimator. The simulation shows that the larger the value of power function in intensity function, it is required the length of the observation interval to obtain the convergent of the estimator.
Formation of Non-Perfect Maze Using Prim’s Algorithm Ihsan, Mahyus; Razi, Fahrul; Maulidi, Ikhsan; Apriliani, Vina; Zahnur, Zahnur
JTAM (Jurnal Teori dan Aplikasi Matematika) Vol 7, No 2 (2023): April
Publisher : Universitas Muhammadiyah Mataram

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31764/jtam.v7i2.12772

Abstract

Maze is a place that has many paths with tortuous paths that are misleading and full of dead ends and can be viewed as a grid graph. A non-perfect maze is a maze that has a cycle. This research produces an algorithm that can form a non-perfect maze with a size of m×n which has two types of bias. The first bias is the composition of the percentage of horizontal and vertical partitions. The second bias is the percentage of the number of cycles. The algorithm created in this study was generated by modifying Prim’s algorithm and the use of Fisher-Yates algorithm which is used in random selection in Prim’s algorithm. The non-perfect maze algorithm begins with the calculation of the parameter values of the two types of bias and continues with forming a perfect maze and ends with forming a non-perfect maze. The algorithm that has been designed can form a non-perfect maze with a complexity of O(|E|^2), where E is the set of edges of an m×n grid graph. Flash-based application development is also carried out in order to implement algorithms to obtain a non-perfect maze. The non-perfect maze is produced in a two-dimensional visual form in the form of an image along with its corresponding grid graph. The application is capable of displaying up to the first 20 solutions of the biased maze. 
Co-Authors Al Aiyub DEDI SUHAIMI Fahrul Razi Hafnani Hafnani Husaini Husaini Husaini Husaini Ikhsan Maulidi IKHSAN MAULIDI Marwan Ramli Marwan Ramli Maulidi, Ikhsan Rahma Zuhra Rahmadsyah, Rizki Rahmah Zuhra Ramadhan, Teuku Hafiez Reza Wafdan RR. Ella Evrita Hestiandari SYARIFAH MEURAH YUNI Vina Apriliani Zahnur, Zahnur