Garuda - Garba Rujukan Digital

p-Index From 2021 - 2026

3.982

P-Index

This Author published in this journals

All Journal Jurnal Ilmu Komputer Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi) JURNAL MEDIA INFORMATIKA BUDIDARMA J-SAKTI (Jurnal Sains Komputer dan Informatika) IJISTECH (International Journal Of Information System & Technology) KOMIK (Konferensi Nasional Teknologi Informasi dan Komputer) The IJICS (International Journal of Informatics and Computer Science) JURIKOM (Jurnal Riset Komputer) Building of Informatics, Technology and Science Islam Universalia : International Journal of Islamic Studies and Social Sciences REMIK : Riset dan E-Jurnal Manajemen Informatika Komputer JOURNAL OF INFORMATION SYSTEM RESEARCH (JOSH) Journal of Computer System and Informatics (JoSYC) Jurnal Sistem Komputer dan Informatika (JSON) TIN: TERAPAN INFORMATIKA NUSANTARA Jurasik (Jurnal Riset Sistem Informasi dan Teknik Informatika) IJISTECH JPM: JURNAL PENGABDIAN MASYARAKAT Journal of Informatics Management and Information Technology Journal of Social Responsibility Projects by Higher Education Forum Jurnal Teknisi J-SAKTI (Jurnal Sains Komputer dan Informatika) Bulletin of Information Technology (BIT) KETIK : Jurnal Informatika ORAHUA : Jurnal Pengabdian Kepada Masyarakat

Surya Darma Nasution

Universitas Budi Darma, Medan

Author-ID : 2490120

Religion Aerospace Engineering Agriculture, Biological Sciences & Forestry Arts Humanities Astronomy Automotive Engineering Biochemistry, Genetics & Molecular Biology Chemical Engineering, Chemistry & Bioengineering Civil Engineering, Building, Construction & Architecture Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Dentistry Earth & Planetary Sciences Economics, Econometrics & Finance Education Electrical & Electronics Engineering Energy Engineering Environmental Science Health Professions Immunology & microbiology Industrial & Manufacturing Engineering Languange, Linguistic, Communication & Media Law, Crime, Criminology & Criminal Justice Library & Information Science Materials Science & Nanotechnology Mathematics Mechanical Engineering Medicine & Pharmacology Neuroscience Nursing Physics Public Health Social Sciences Transportation Veterinary Other

Published : 66 Documents Claim Missing Document

Claim Missing Document

Articles

2 3 4 5 6

Penerapan Algoritma Gopala-Hemachandra Code2 (GH-2(n)) Pada Kompresi File Audio Sinta M. Panjaitan; Surya Darma Nasution; Bister Purba
KOMIK (Konferensi Nasional Teknologi Informasi dan Komputer) Vol 4, No 1 (2020): The Liberty of Thinking and Innovation
Publisher : STMIK Budi Darma

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30865/komik.v4i1.2676

Current technological developments are increasingly advanced which also have an impact on communication lines. The development is based on the emergence of the internet, through the internet, many things have been done, one of which is the exchange of information. However, this development creates new problems, namely due to the relatively large size so that it requires storage media to accommodate all the data received. From these problems, a technique was found in order to solve all the problems previously found. The technique is called the compression technique. is the process of converting the original (raw) data into another data stream with a different format that has a smaller size or the process of converting a set of data into coded form in order to save storage space. In this case, what I use in compression is the Gopala-Hemachandra Code 2 (GH-2 (n)) algorithm for compressing audio files. So from this research we will get what percentage of the data before the compression process is carried out with those that have been demcompressed. So that users can also save more storage space without losing information, besides that the time used in the transmission process will be less.Keywords: Compression1, Audio Files2, Gopala-Hemachandra Code 2 (GH-2 (n))2

IMPLEMENTASI ALGORITMA SUBEXPONENTIAL CODE UNTUK KOMPRESI FILE GAMBAR Amir Maniur Silitonga; Surya Darma Nasution; Putri Ramadhani
KOMIK (Konferensi Nasional Teknologi Informasi dan Komputer) Vol 3, No 1 (2019): Smart Device, Mobile Computing, and Big Data Analysis
Publisher : STMIK Budi Darma

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30865/komik.v3i1.1611

Image file size is sometimes relatively large where the better the quality of the image produced, the pixel shape needed to record the image is bigger. With a very large image file size, at the time of the transfer process the transfer process could fail because the storage space media exceeds its limit. As for the Solution in this problem is how the image file can be compressed in order to accelerate the transfer and storage of image files. compression on image files is done by reducing the shape of the image file by reducing the bit in the image file, but does not eliminate the information data in it. By running compression, large files will shrink in size so that it can save storage space. In this study, the algorithm used is Subexponential Code, by using this method, the compression results from the k value have different results from each value, and the compression results will be advantageous in sending, and transferring image files will be easier.Keywords: image file compression, subexponential code algorithm

APLIKASI PENAJAMAN CITRAA STREET VIEW MENGGUNAKAN METODE GRAMD SCHMIDT SPECTRAL SHARPENING DAN HIGH PASS FILTERING Erna Verawati; Surya Darma Nasution; Imam Saputra
KOMIK (Konferensi Nasional Teknologi Informasi dan Komputer) Vol 3, No 1 (2019): Smart Device, Mobile Computing, and Big Data Analysis
Publisher : STMIK Budi Darma

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30865/komik.v3i1.1584

Sharpening the image of the road display requies a degree of brightness in the process of sharpening the image from the original image result of the improved image. One of the sharpening of the street view image is image processing. Image processing is one of the multimedia components that plays an important role as a form of visual information. There are many image processing methods that are used in sharpening the image of street views, one of them is the gram schmidt spectral sharpening method and high pass filtering. Gram schmidt spectral sharpening method is method that has another name for intensity modulation based on a refinement fillter. While the high pass filtering method is a filter process that btakes image with high intensity gradients and low intensity difference that will be reduced or discarded. Researce result show that the gram schmidt spectral sharpening method and high pass filtering can be implemented properly so that the sharpening of the street view image can be guaranteed sharpening by making changes frome the original image to the image using the gram schmidt spectral sharpening method and high pass filtering.Keywords: Image processing, gram schmidt spectral sharpening and high pass filtering.

Performance Comparison Analysis of the Elias Delta Code Algorithm with the Even Rodeh Code Algorithm for Compressing Image Files Elvia Hariska; Ega Yuliani; Surya Darma Nasution
The IJICS (International Journal of Informatics and Computer Science) Vol 5, No 1 (2021): March 2021
Publisher : STMIK Budi Darma

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30865/ijics.v5i1.2888

A file or files have a large size, especially an image file. So that it can affect a storage memory and also mess in the speed of data transmission. If an image file has a large capacity it can affect the sending process. So that the sending process has two possibilities, namely the image file sent will require a long process or the image file will experience failure in sending because the storage size exceeds the maximum limit. This problem can be overcome by compressing the data. Data compression can reduce the size of data storage on both internal and external memory, speeding up data transmission due to smaller storage sizes. Data compression has several algorithms that can be used. In this research, the writer will compare the performance of Elias Delta Code algorithm with even Rodeh Code algorithm. Thus obtaining which algorithm is the most efficient used for the image file compression process.

Data Compression Using Stout Codes Surya Darma Nasution
The IJICS (International Journal of Informatics and Computer Science) Vol 3, No 1 (2019): March 2019
Publisher : STMIK Budi Darma

The need for data compression is now very important because it is affected by human nature that tends to collect data and also influenced by the need for a process for fast data transfer because the data size becomes smaller. Now many compression algorithms can be used, one of which is the stout codes algorithm. how the stout code algorithm works by encoding characters that often appear with smaller codes than characters with fewer occurrences. The results of data compression in the form of text with the algorithm of the stout code algorithm is the size of the text data becomes smaller with a compression ratio 60% and space saving 40%.

Comparison Analysis with Huffman Algorithm and Goldbach Codes Algorithm in File Compression Text Using the Method Exponential Comparison Abu Sani Tanjung; Surya Darma Nasution
The IJICS (International Journal of Informatics and Computer Science) Vol 4, No 1 (2020): March 2020
Publisher : STMIK Budi Darma

With the development of technology at this time many people know about compression. In simple compression is a process to shrink the file from its original size. At this time compression applications that are often used are WinZip, WinRar, and 7-Zip, namely with the aim of compressing documents and saving space on memory or data transmission. Compressed data can be in the form of images, audio, video and text. The use of the Huffman algorithm and the Goldbach Codes algorithm in compressing text files is intended to provide enormous benefits in the sending and storage process and requires less memory space compared to uncompressed text. The algorithm starts by providing a string of inputs as input, how to produce an algorithm output in the form of a binary string or code that translates each input string, so that the string has a small number of bits compared to strings that are not compressed. Thus, the problem is how to obtain the code with sorted characters and frequency tables as input and shorter binary code as output. In applying the Huffman algorithm and the Goldbach Codes algorithm in compressing text files is very good, the results were not reduced from the original file or there was no reduction

Application Of Weight Sum Model (WSM) In Determining Special Allocation Funds Recipients Dikki Handoko; Mesran Mesran; Surya Darma Nasution; Yuhandri Yuhandri; Heri Nurdiyanto
The IJICS (International Journal of Informatics and Computer Science) Vol 1, No 2 (2017): September 2017
Publisher : STMIK Budi Darma

In the management of education is not uncommon educational institutions sometimes receive sources of funds from outside, one of which comes from the Department of Education in the implementation of its duty to provide one allocation of funds called Special Allocation Fund (DAK). This assistance is from APBN revenues to areas devoted to schools to help fund special activities such as the addition or improvement of school facilities and infrastructure. The application of this special allocation grantee needs to use a Decision Support System (CMS) to allow decisions to be generated in favor of the DAK beneficiary. In the application of SPK required MCDM method, the Weight Sum Model (WSM), which is a simple method and able to generate ranking from the proposer alternatives in a special allocation fund.

Implementasi Algoritma Soundex Pada Sistem Pencarian Radio Internasional Tri Handa Mirza; Berto Nadeak; Siti Nurhabibah Hutagalung; Surya Darma Nasution; Imam Saputra
JURIKOM (Jurnal Riset Komputer) Vol 8, No 1 (2021): Februari 2021
Publisher : STMIK Budi Darma

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30865/jurikom.v7i4.2278

Many media are used to find sources of information needed, one of which is the radio which has been favored by many people for the means of getting information and entertainment. Radio is able to maintain its existence until the present technological era because of the ease of getting information and how to use it which is not difficult. The development of technology makes the demand for more information and radio broadcasts continue to increase, both National and International. The need to get an International Radio broadcast encourages the writer to present a solution so that a complete list of International Radio broadcasts with their frequency can be found quickly with the Implementation of the Soundex Algorithm. Soundex method is a search method based on the criteria of words or sentences that are entered and adjusted to the parameters of the existing information if the words or sentences are within the parameters that have been adjusted, the application of the Soundex algorithm will be used to find information more quickly

Implementasi Metode Adaptive Power Law Transformation Dalam Perbaikan Citra Underwater Nilmah Nilmah; Surya Darma Nasution; Siti Nurhabibah Hutagalung
JURIKOM (Jurnal Riset Komputer) Vol 7, No 6 (2020): Desember 2020
Publisher : STMIK Budi Darma

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30865/jurikom.v7i6.2593

Although an image is rich in information, but often the image we have has a decrease in the quality (degradation) of the image that is a decrease in image quality, for example because it contains defects or noise (noise), the color is too contrast, less sharp, blurring, and so on. Of course this kind of image becomes more difficult to interpret because the information conveyed by the image is less clear. In the water environment, light factors greatly influence the results of the image quality obtained. With the deepening of underwater shooting, the results obtained will be the darker the quality of the underwater image. Underwater imagery is widely used as an object in various activities such as underwater habitat mapping, underwater environment monitoring, underwater object search. uneven lighting and bluish tones. One of the factors that influence the recognition results in pattern recognition is the quality of the image that is inputted. The image acquired from the source does not always have good qualit. To improve the quality of underwater images as stated above so that the information contained in the image can be well understood, a filtering method is needed, namely Adaptive Power Law Transformation. With this method and Microsoft Visual Basic 2008 program support is expected to produce a better image than before.

SIMULASI ANTRIAN PELAYANAN PEMBAGIAN DANA PROGRAM SIMPANAN KELUARGA SEJAHTERA MENGGUNAKAN ALGORITMA FIRST COME FIRST SERVER (STUDI KASUS : PT. POS INDONESIA (PERSERO) MEDAN) Taronisokhi Zebua; Syukur Novertiani Gulo; Surya Darma Nasution; Guidio Leonarde Ginting
JURIKOM (Jurnal Riset Komputer) Vol 3, No 4 (2016): Agustus 2016
Publisher : STMIK Budi Darma

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

Co-Authors Abdul Halim Lubis Abdul Halim Lubis Abdul Karim Abdul Khair Tarigan Abu Sani Tanjung Afriany, Joli Ahmad Qorib Alwin Fau Amir Maniur Silitonga Andsyah Putera Utama Siahaan Bister Purba Cici Mulya Sari Daulay, Nur Hasanah Depika, Dwi Ayu Dikki Handoko Dito Putro Utomo Efori Buulolo Ega Yuliani Elvia Hariska Erna Verawati Ervina, Nina Fadlina Fince Tinus Waruwu Fitri Ruth Diani Br Simangunsong Fitri, Juli Guidio Leonarde Ginting Halimah Ani Harika Fitri Sinurat Hasibuan, Nelly Agustina Hikma Widayu Hotmoko Tumanggor Hutabarat, Sumiaty Imam Saputra Imam Saputra Imam Saputra Irliansyah, Muhammad Rio Joshua Feliex D. Sirait Kurnia Ulfa Maharani Maharani, Maharani Mardiana Haloho Mesran, Mesran Muhammad Syahrizal Muhammad Wirza Pratama Agatmadja Murdani Murdani, Murdani Natalia Silalahi Natalia Silalahi Natalia Silalahi, Natalia Nelly Astuti Hasibuan Nilmah Nilmah Nurdiyanto, Heri Nurma Ningsih Pane, Latifah Hanum Pane, Latifah Hanum Pramadi, Agus Adi Pratiwi, Rizka Dwi Puji Lestari Purba, Bister Putri Ramadhani Putri Ramadhani Rian Syahputra Rivalri Kristianto Hondro Rizky, Nadia Fariza Ronda Deli Sianturi S Sunaryo Saidi Ramadan Siregar Saparuddin Siregar Sari, Tetti Purnama Sari, Tetti Purnama Sianipar, Fitri Nur Indah Sari Sinta M. Panjaitan Sirait, Joshua Feliex D. Siti Nurhabibah Hutagalung Sri Wahyuni Sri Wanti Nasution Suginam Suginam Sukma Hakiki Silitonga Sunaryo, S Sutiksno, Dian Utami Syukur Novertiani Gulo Tari, Ratiya Taronisokhi Zebua Tri Handa Mirza Ulfa, Kurnia Vify Ernanda William Ramdhan Yuhandri Yuhandri, Yuhandri

Title

Found 66 Documents
Search

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title Search

Found 66 Documents Search

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title

Found 66 Documents
Search