Articles
<![CDATA[SIMULASI ANTRIAN PELAYANAN PEMBAGIAN DANA PROGRAM SIMPANAN KELUARGA SEJAHTERA MENGGUNAKAN ALGORITMA FIRST COME FIRST SERVER (STUDI KASUS : PT. POS INDONESIA (PERSERO) MEDAN) ]]>
<![CDATA[Taronisokhi Zebua]]>;
<![CDATA[Syukur Novertiani Gulo]]>;
<![CDATA[Surya Darma Nasution]]>;
<![CDATA[Guidio Leonarde Ginting]]>
<![CDATA[ JURIKOM (Jurnal Riset Komputer) Vol 3, No 4 (2016): Agustus 2016 ]]>
Publisher : <![CDATA[STMIK Budi Darma ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (379.651 KB)
|
DOI: 10.30865/jurikom.v3i4.337
<![CDATA[Masalah antrian sangat sering dijumpai pada kehidupan sehari-hari. Seperti yang dihadapi oleh Kantor Pos dengan peran ganda. Selain penyedia layanan jasa antar barang, kantor pos juga berperan sebagai tempat penyalur dana program simpanan keluarga sejahtera. Analisis yang dilakukan meliputi pembentukan model antrian adalah model single queue multi server yang memiliki satu pintu input dan satu pintu output, simulasi antrian single queue multi server yaitu satu antrian ataupun tunggal dan mempunyai fasilitas, mempunyai banyak pelayanan dan lebih dari satu. Simulasi merupakan salah satu strategi pembelajaran yang bertujuan memberikan pengalaman belajar yang lebih kongkrit melalui tiruan-tiruan yang mendekati bentuk sebenarnya. Simulasi antrian pada algoritma first come first server menggambarkan bahwa orang yang lebih dahulu datang akan dilayani terlebih dahulu. Kalau ada proses tiba pada waktu yang sama, maka pelayanan mereka dilaksanakan melalui urutan mereka dalam antrian. Proses di antrian belakang harus menunggu sampai semua proses di depannya selesai. Antrian FCFS merupakan permasalahan yang ada terutama menyangkut kedatangan pelanggan (konsumen), permintaan pelayanan, kemudian terjadi antrian atau baris tunggu untuk memperoleh pelayanan tersebut, sehingga ada waktu tunggu. Seiring dengan kemajuan yang dicapai dengan menggunakan teknologi komputer, tahun demi tahun berkembang terus dengan pesatnya, untuk menyelesaikan masalah antrian ini dapat dipergunakan model antrian FCFS]]>
<![CDATA[Perancangan Aplikasi Pengacakan Pemenang Undian Berhadiah Menggunakan Metode Blum-Blum Shub Berbasis Android ]]>
<![CDATA[Citono Harahap]]>;
<![CDATA[Garuda Ginting]]>;
<![CDATA[Taronisokhi Zebua]]>
<![CDATA[ JURIKOM (Jurnal Riset Komputer) Vol 7, No 2 (2020): April 2020 ]]>
Publisher : <![CDATA[STMIK Budi Darma ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (298.018 KB)
|
DOI: 10.30865/jurikom.v7i2.2112
<![CDATA[Lottery or commonly known as a lottery is one way to raise funds used for humanitarian projects and social activities or a way to determine the winner randomly. So, the lottery does a random gift-giving process and the lottery is synonymous with the lottery. The design of a lottery winner randomization application is one of the more modern ways and can attract many lottery participants to enter the lottery by reducing the cost of printing and distributing lottery tickets. One of them is the blum blub shub method, which is a method that functions to generate random numbers mathematically with the resulting output is a series of binary numbers. the numbers that are made as winners. The designed application only simulates the process of inputting lottery numbers and the randomization process to get the winning numbers]]>
<![CDATA[Pembangkitan Kunci Beaufort Cipher Dengan Teknik Blum-blum Shub pada Pengamanan Citra Digital ]]>
<![CDATA[Eferoni Ndruru]]>;
<![CDATA[Taronisokhi Zebua]]>
<![CDATA[ Bulletin of Information Technology (BIT) Vol 3 No 2: Juni 2022 ]]>
Publisher : <![CDATA[Forum Kerjasama Pendidikan Tinggi (FKPT) ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.47065/bit.v3i2.302
<![CDATA[Data security is not only due to the complexity of the algorithms used, but one of the most important factors is the security of the keys used. One of the most popular data that needs to be backed up today is digital images. However, these days, the algorithms used to back up data are often attacked. This is because the structure of the key formations used is still weak. One of the data security algorithms that form a simple key is the Beaufort cipher. It relies on the duplication of key characters to form the key for each protected element. Key generators based on blum-blum shub technology can generate very random and difficult-to-guess keys, so the strength of the keys you use can enhance the resilience of protected data. Keys generated based on blum-blum shub technology will later be used in the process of encrypting and decrypting pixel values in digital images.]]>
<![CDATA[Sistem Pakar Diagnosa Penyakit Pada Sistem Pencernaan Kelinci Menggunakan Metode Fuzzy Expert System ]]>
<![CDATA[Tiffani Astrid]]>;
<![CDATA[Taronisokhi Zebua]]>;
<![CDATA[Anggiat M Hatuaon Sihite]]>
<![CDATA[ Journal of Information System Research (JOSH) Vol 1 No 3 (2020): April 2020 ]]>
Publisher : <![CDATA[Forum Kerjasama Pendidikan Tinggi (FKPT) ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (373.667 KB)
<![CDATA[Diseases of the digestive system are a type of disease that often attacks rabbits. This disease is also one of the causes of death in rabbits. This is based on interviews with veterinarians who say that, if diseases of the digestive system are not given the treatment quickly and precisely it will cause death in rabbits. Most veterinarians only open practices in big cities, so it is not uncommon for rabbit breeders who are late in giving treatment to diseases of the digestive system suffered by their pet rabbits. Based on the above problems, it is necessary to create an expert system that can help rabbit keepers and veterinarians in diagnosing diseases in the digestive system of rabbits, because so far there has not been any application to deal with this. The Fuzzy Expert System method will calculate every symptom experienced by rabbits by using the inference method from mamdani. In the Mamdani method, both input and output variables are divided into one or more fuzzy sets. The end result will be done by the process of processing a fuzzy set obtained from the composition of fuzzy rules to produce output in the form of a number in the fuzzy set domain, while this process is called affirmation (defuzzification). From the results of testing the system using the visual basic 2008 program is good to use, but still needs a lot of development in applying it to the expert system]]>
<![CDATA[Kinerja Algoritma Yamamoto’s Recursive Code dan Algoritma Fixed Length Binary Encoding pada Kompresi File PDF ]]>
<![CDATA[Yulrismawati Sihura]]>;
<![CDATA[Taronisokhi Zebua]]>;
<![CDATA[Hukendik Hutabarat]]>
<![CDATA[ Journal of Computer System and Informatics (JoSYC) Vol 3 No 4 (2022): August 2022 ]]>
Publisher : <![CDATA[Forum Kerjasama Pendidikan Tinggi (FKPT) ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.47065/josyc.v3i4.2109
<![CDATA[The use of files in digital form is currently growing and requires media to store them. The more files that store, the more storage space need. This encourages the development of file reduction techniques or data compression techniques with the aim of reducing the required storage space. The compression technique has several algorithms that can be used to compress files such as Yamamoto's recursive code algorithm and Fixed Length Binary Encoding (FLBE). These algorithms have different performance to produce quality compressed results, so they need to be compared. This study describes the analysis and comparison of the performance of the two algorithms based on the exponential method as measured by the quality of the compressed pdf file. The exponential comparison method is one of the methods of the Decision Support System (DSS) to determine the priority order of decision alternatives with multiple criteria. Compression quality parameters that are measured as an alternative comparison are the value of the ratio of compression, compression ratio, space saving. Based on the results of the comparison with Exponential Comparison Method (MPE), it was found that the fixed length binary encoding algorithm has a better performance with a value of 2.55% compared to the Yamomoto's recursive code algorithm with a smaller value of 2.22%.]]>
<![CDATA[Penerapan Multiply With Carry Generator pada Proses Pembangkitan Kunci Algoritma Beaufort Cipher ]]>
<![CDATA[Taronisokhi Zebua]]>
<![CDATA[ Journal of Information System Research (JOSH) Vol 4 No 2 (2023): January 2023 ]]>
Publisher : <![CDATA[Forum Kerjasama Pendidikan Tinggi (FKPT) ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.47065/josh.v4i2.2928
<![CDATA[The strength of the algorithm used in data security does not only depend on the complexity of the algorithm used, but lies in the randomness and complexity of the key solving used. The repetition of the same character in the formation of a key used by a data security algorithm is very vulnerable to attack, because it can make it easier for attackers to break the algorithm itself. One of the commonly used data security algorithms is the comfort cipher algorithm. The number of key characters needed in this algorithm is directly proportional to or equal to the number of characters of text or data that is secured. Using a number of key characters like this allows the repetition of the same characters, making it easier for attackers to find out the pattern of the keywords used. Based on this, random key generation is necessary to optimize the robustness of the algorithm used. Multiply with carry generator is a random number generation technique that has advantages in speed and length of randomization cycle so that it has more seed variations to the generated random numbers. This study describes how to apply this random number generation method to generate keywords used in the beaufort cipher algorithm, so that the keys used can be more optimal and more complicated for attackers to crack.]]>
<![CDATA[Sistem Pendukung Keputusan Pemilihan Teknisi Fiber Optic Terbaik Dengan Grey Absolute Decision Analysis Methods (Studi Kasus: PT. Karya Solusi Prima Sejahtera) ]]>
<![CDATA[Aditya Trinugraha]]>;
<![CDATA[Taronisokhi Zebua]]>;
<![CDATA[Anda Yanny]]>
<![CDATA[ KOMIK (Konferensi Nasional Teknologi Informasi dan Komputer) Vol 6, No 1 (2022): Challenge and Opportunity For Z Generation in Metaverse Era ]]>
Publisher : <![CDATA[STMIK Budi Darma ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.30865/komik.v6i1.5693
<![CDATA[PT. Karya Solusi Prima Sejahtera is a company engaged in providing professional services in the field of information technology and telecommunications. PT. Karya Solusi Prima Sejahtera also provides services for the construction of telecommunications network and information technology facilities and infrastructure. As an effort to improve the performance of fiber optic technicians at PT. Karya Solusi Prima Sejahtera carried out a performance evaluation stage and then gave rewards to fiber optic technicians who were chosen as the best. The problems that occur in determining the results of the selection of the best fiber optic technician at PT. Karya Solusi Prima Sejahtera, namely the party in charge is still making decisions based on the assessment of one party based on the subjective value of the leadership. The negative impact of this procedure is the result of decision making based on the subjective assessment of the leadership at PT. Karya Solusi Prima Sejahtera, namely the occurrence of injustice because the results of the election were not in accordance with the performance of each alternative that became a candidate for the recipient of the rewards. In an effort to overcome the above problems, in this study the authors built a decision support system for selecting the best fiber optic technician at PT. Karya Solusi Prima Sejahtera using a desktop-based programming language. The decision support system for selecting the best fiber optic technician built for PT. The work of Solusi Prima Sejahtera was carried out by applying the gray absolute decision analysis method in order to produce accurate and reliable decision outputs.]]>
<![CDATA[ESTIMATED GRADUATION OF GRAPHIC DESIGN TRAINEES AT LPK2-PASCOM IN TAKING COMPETENCY EXAMS WITH THE SUPPORT VECTOR MACHINE (SVM) ALGORITHM ]]>
<![CDATA[Ndruru, Eferoni]]>;
<![CDATA[Zebua, Taronisokhi]]>
<![CDATA[ INFOKUM Vol. 10 No. 5 (2022): December, Computer and Communication ]]>
Publisher : <![CDATA[Sean Institute ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
<![CDATA[This paper aims to predict the graduation of graphic design training participants at computer course training institutions to take competency exams by applying the Support Vector Machine (SVM) algorithm. Data sourced through field studies and literature studies. Among them by conducting direct observations and interviews on research objects and supported by the appropriate literature. While the data analysis method used is descriptive qualitative method. From the results of the research that the researchers have done, there are obstacles, including: many participants did not pass, because they were not sure enough to select their abilities during the training whether they deserved to be tested or not. Therefore, the author intends to create a graduation estimation system using the Support Vector Machine (SVM) algorithm. So it is hoped that this system can predict the passing of competency test participants.]]>
<![CDATA[Optimalisasi Beaufort Cipher Menggunakan Pembangkit Kunci RC4 Dalam Penyandian SMS ]]>
<![CDATA[Diana, Mia]]>;
<![CDATA[Zebua, Taronisokhi]]>
<![CDATA[ J-SAKTI (Jurnal Sains Komputer dan Informatika) Vol 2, No 1 (2018): EDISI MARET ]]>
Publisher : <![CDATA[STIKOM Tunas Bangsa Pematangsiantar ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (727.978 KB)
|
DOI: 10.30645/j-sakti.v2i1.52
<![CDATA[The key in the cryptography algorithm is a very important role in the process of encryption and decryption. The more random key numbers are used, the more random the ciphers are generated. The RC4 algorithm and the Beaufort cipher are algorithms of cryptographic techniques. The RC4 algorithm has advantages in generating random keys, whereas Beaufort ciphers have a disadvantage in terms of the number of keys used too much. This research describes how to optimize key formation in Beaufort algorithm by utilizing the key generation process on the RC4 algorithm which is implemented on encoding SMS which until now has not been point-to-point (not directly sent to destination). The results of this study provide convenience for users in the process of generating encryption and decryption keys and generate SMS cipher more random and difficult to understand by others.]]>
<![CDATA[Optimalisasi Beaufort Cipher Menggunakan Pembangkit Kunci RC4 Dalam Penyandian SMS ]]>
<![CDATA[Diana, Mia]]>;
<![CDATA[Zebua, Taronisokhi]]>
<![CDATA[ J-SAKTI (Jurnal Sains Komputer dan Informatika) Vol 2, No 1 (2018): EDISI MARET ]]>
Publisher : <![CDATA[STIKOM Tunas Bangsa Pematangsiantar ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.30645/j-sakti.v2i1.52
<![CDATA[The key in the cryptography algorithm is a very important role in the process of encryption and decryption. The more random key numbers are used, the more random the ciphers are generated. The RC4 algorithm and the Beaufort cipher are algorithms of cryptographic techniques. The RC4 algorithm has advantages in generating random keys, whereas Beaufort ciphers have a disadvantage in terms of the number of keys used too much. This research describes how to optimize key formation in Beaufort algorithm by utilizing the key generation process on the RC4 algorithm which is implemented on encoding SMS which until now has not been point-to-point (not directly sent to destination). The results of this study provide convenience for users in the process of generating encryption and decryption keys and generate SMS cipher more random and difficult to understand by others.]]>
