Article Per Year (5 Year)
p-Index From 2020 - 2025
0.817
P-Index
This Author published in this journals
All Journal JOURNAL OF INFORMATICS AND TELECOMMUNICATION ENGINEERING Zero : Jurnal Sains, Matematika, dan Terapan Data Science: Journal of Computing and Applied Informatics Journal of Saintech Transfer TECHSI - Jurnal Teknik Informatika
Sri Melvani Hardi
Universitas Sumatera Utara
Agriculture, Biological Sciences & Forestry Chemistry Computer Science & IT Decision Sciences, Operations Research & Management Education Engineering Mathematics Physics Other

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

Found 2 Documents
Search
Journal : TECHSI - Jurnal Teknik Informatika

 1 
ANALISIS MAPPING PADA PARTIALLY MAPPED CROSSOVER DALAM ALGORITMA GENETIKA PADA TRAVELLING SALESMAN PROBLEM Sri Melvani Hardi; Muhammad Zarlis; Erna Budiarti
TECHSI - Jurnal Teknik Informatika Vol 6, No 1 (2014)
Publisher : Teknik Informatika Universitas Malikussaleh

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.29103/techsi.v6i1.167

Abstract

Traveling salesman problem is the problem how salesman can set tour to visit a number of cities which known distance of the city with other cities so that the distance is the minimum distance where the salesman can only visit the city exactly once. To resolve TSP problem, there are many optimization methods that can be used one of them which is a genetic algorithm. Genetic algorithm is an algorithm which have same search method as a mechanism of biological evolution. Crossover is a genetic operator which the process of exchanging some genes on chromosome first parent with the majority of genes in the two parent chromosomes to form a new chromosome .One of the crossover method used in solving traveling salesman problem is partially mapped crossover ( PMX ),where the process mapping of PMX are determines the variation exchange of genes on chromosomes that affect the achievement of best fitness on 2 chromosome. In this study the first variation (PMX variation I) is designed using random point position while in the second variation (PMX variation II) is designed by using the change in the mapping area. Testing in this study using data from the Travelling Salesman Problem Library (TSPLIB). The result obtained that PMX which designed by using randomly cut position have best fittness better than PMX is designed by changing the position of the mapping area and if it compared with the general form of PMX with the same position cut point.
IMPLEMENTASI KRIPTOGRAFI HIBRID DENGAN ALGORITMA ELGAMAL DAN ALGORITMA ONETIME PAD(OTP) DALAM PENGAMANAN FILE AUDIO BERBASIS DESKTOP Sri Melvani Hardi; Daniel Hamonangan; Muahmmad Zarlis
TECHSI - Jurnal Teknik Informatika Vol 10, No 2 (2018)
Publisher : Teknik Informatika Universitas Malikussaleh

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.29103/techsi.v10i2.903

Abstract

Audio merupakan salah satu cara untuk menyampaikan informasi. Bertukar informasi audio dapat dilakukan dengan mudah pada saat ini. Namun hal ini menyebabkan informasi audio yang bersifat pribadi ataupun rahasia menjadi tidak aman. Maka dari itu diciptakanlah sebuah sistem pada desktop yang mampu mengamankan file audio dengan menggunakan algoritma One-Time Pad dan algoritma ElGamal. Algoritma One-Time Pad merupakan algoritma yang sangat aman dalam mengamankan data audio namun memiliki kerentanan didalam kebocoran informasi kunci maka dibutuhkan algoritma ElGamal yang dapat mencegah kebocoran informasi kunci. Berdasarkan pengujian didapatkan hasil bahwa cepat lambatnya waktu proses enkripsi dan proses dekripsi, dipengaruhi oleh ukuran data file audio .Semakin besar data file audio tersebut maka semakin lambat waktu proses yang dilakukan. Hasil dari sistem ini berupa file audio yang terenkripsi, file kunci OTP terenkripsi yang dapat mengamankan data.
Co-Authors Br Sirait, Friska Pegrisentia Daniel Hamonangan Deliyana Siagian Efendi, Syahril Erna Budiarti Hamonangan, Daniel Hayatunnufus Hayatunnufus Ivan Jaya Jaya, Ivan Marischa Elveny, Marischa Muahmmad Zarlis Muhammad Zarlis Muhammad Zarlis, Muhammad Zarlis, Muahmmad