Claim Missing Document
Check
Articles

PERANCANGAN APLIKASI KOMPRESI FILE TEKS DENGAN MENERAPKAN ALGORTIMA FIXED LENGTH BINARY ENCODING (FLBE) Pratiwi, Rizka Dwi; Nasution, Surya Darma; Fadlina, Fadlina
JURNAL MEDIA INFORMATIKA BUDIDARMA Vol 2, No 1 (2018): Januari 2018
Publisher : STMIK Budi Darma

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30865/mib.v2i1.813

Abstract

The higher activity of data exchange transactions both online and offline raises concerns for some parties, large data sizes result in a waste of memory and slow data transfer and delivery processes. For this reason, a technique is needed to change the size of the data to be smaller. This technique is called compression or better known as data compression. Data compression is a process of converting a set of data into a form of code to save data storage requirements. Fixed Length Binary Encoding Algorithm (FLBE) uses a lossless technique that does not eliminate information at all, only representing some of the same information. The results obtained from the application of Fixed Length Binary Encoding algorithm in the process of compression and decompression include compression capacity, compression ratio and compression and decompression time. In accordance with the results of the experiments carried out, it can be seen that the data originally having a larger size can be compressed well implemented in text files.
Decision Support System for The Selection of North Sumatra Atlet Drumband By Applying Elimination and Choice Translation Reality (ELECTRE) (Case Study: United States of Drumband Indonesia North Sumatra Region) Sunaryo, S; Silalahi, Natalia; Mesran, M; Nasution, Surya Darma; Ginting, Guidio Leonarde
IJISTECH (International Journal of Information System & Technology) Vol 4, No 1 (2020): November
Publisher : Sekolah Tinggi Ilmu Komputer (STIKOM) Tunas Bangsa

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (890.023 KB) | DOI: 10.30645/ijistech.v4i1.93

Abstract

Unity Drumband Indonesia (PDBI) Region of North Sumatra is an organizational body engaged in sports groups, which involves players in various musical instruments. In selecting players, PDBI North Sumatra through the committee to conduct strict selection, through a judging system with several stages of a rigorous process. From the selection of participants, compare each criterion one by one to get the best athletes. Implementation of decision support systems is expected to provide the right solution and can assist the jury in generating a decision. Thus the process of selecting athletes can produce a decision directly without a long time. So that accelerate the selection process of drum band athletes who will strengthen the team of North Sumatra. The Elimination and Choice Translation Reality (ELECTRE) method is required in decision support systems for the selection of drum band athletes who will strengthen the North Sumatra team.
PENERAPAN ALGORITMA LEVENSTEIN PADA APLIKASI KOMPRESI FILE MP3 Sari, Tetti Purnama; Nasution, Surya Darma; Hondro, Rivalri Kristianto
KOMIK (Konferensi Nasional Teknologi Informasi dan Komputer) Vol 2, No 1 (2018): Peranan Teknologi dan Informasi Terhadap Peningkatan Sumber Daya Manusia di Era
Publisher : STMIK Budi Darma

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

Abstract

Compressed files require less disk space than files that are not compressed, so compressing is useful for backing up data by using storage space to be small or to send information over the Internet faster. MP3 makes the audio format often used because the data stored resembles the original data when recorded and has a size that is not too large compared to other formats. Users besides storing song files, they also store videos and other files and users also want the highest quality data and minimum quantity (size). So to make a lot of empty space and have a size of data that is not large on storage media, a compression method that means to shorten the size of the bits needed for data is needed. Algorithms used in the compression process, including the Levenstein algorithm which is a type of lossless compression. Applying the Levenstein algorithm to the compression process the author wants to know the performance of compression when done by compressing MP3 files, so that large MP3 files will be compressed into smaller sizes, so that the transmission process is carried out faster and reduces the data storage location.Keywords: MP3, File, Levenstein
PENERAPAN ALGORITMA EVEN-RODEH PADA APLIKASI KOMPRESI FILE GAMBAR Pramadi, Agus Adi; Nasution, Surya Darma; Purba, Bister
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.1570

Abstract

Some image files are very large in size. So it requires a large memory storage capacity too, this is certainly a lot of costs that must be spent on the storage media. With the existence of a very large image file size in the process of sending image data files can fail because the storage media exceeds the maximum limit. The above problems can be overcome by performing the process of compressing large image files into small sizes or can reduce the bit size contained in each image file thereby saving storage containers and simplifying the process of transferring image files to other storage media. The solution to this problem is how the image file can be compressed in order to speed up the transfer and storage of image files. Image file compression aims to reduce or reduce the size of the file but does not eliminate the information data in it. With the compression technique, the data was initially large so that the size of the data can be reduced so as to save storage allocation space. In this study using the Even-Rodeh Code algorithm, using the method results in very good compression in tramisi data and transfer of image file allocation easier and faster.Keywords: Image File Compression, Event Rode Code Algorithm
REDUKSI NOISE SALT AND PEPPER PADA CITRA PANKROMATIK MENGGUNAKAN METODE ARITHMATIK MEAN FILTER Pane, Latifah Hanum; Nasution, Surya Darma; Murdani, Murdani
KOMIK (Konferensi Nasional Teknologi Informasi dan Komputer) Vol 1, No 1 (2017): Intelligence of Cognitive Think and Ability in Virtual Reality
Publisher : STMIK Budi Darma

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

Abstract

Banyak gangguan yang dapat terjadi pada citra hasil kamera digital, seperti lensa tidak fokus, muncul bintik-bintik yang disebabkan oleh proses capture yang tidak sempurna, pencahayaan yang tidak merata yang menyebabkan intensitas tidak seragam, kontras citra terlalu rendah sehingga objek sulit dipisahkan dari latar belakangnya atau gangguan yang disebabkan oleh kotoran yang menempel pada citra dan lain sebagainya. Noise yang berupa bintik-bintik dapat mengurangi keindahan sebuah citra. Reduksi noise merupakan suatu proses untuk mengurangi noise pada sebuah citra untuk meningkatkan kualitas citra yang merupakan langkah awal dalam citra. Salah satu teknik yang digunakan untuk mereduksi noise adalah filter yang melakukan pemisahan noise dari objek-objek pada citra. Algoritma yang digunakan pada penelitian ini adalah Arithmetik Mean Filter yang melakukan reduksi pada noise dengan cara mengganti nilai piksel dengan nilai tengah (rata-rata) intensitas piksel citra yang mengandung noise. Citra yang terkena noise biasanya mengalami penurunan mutu, kurangnya keindahan citra tersebut. Sehingga sangat diperlukan teknik reduksi noise, karena dengan teknik ini citra yang tadinya mengandung kotoran yang menempel atau bintik-bintik, kini bisa dibersihkan dan citra terlihat lebih indah bagus.
Penerapan Algoritma Tunstall Code Untuk Mengkompresi File Teks Fitri, Juli; Nasution, Surya Darma; Hutabarat, Sumiaty
JURIKOM (Jurnal Riset Komputer) Vol 8, No 3 (2021): Juni 2021
Publisher : STMIK Budi Darma

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

Abstract

Text generally contains a series of characters and can form a word, letter and narrative. For example, a text file that is large in size results in the sending process taking longer, and uses a large amount of memory space in its storage. So to save storage space and speed up the process of sending text files, it is necessary to do a compression process so that the text file size becomes smaller. One of the file compression techniques that can compress text files well is file compression using the Tunstall code algorithm. The Tunstall code algorithm work system is to determine the sequence of symbols for each codeword, take the highest probability and iterate as many as N (number of symbols) to be compressed. By using the Tunstall code algorithm, the authors managed to compress a text file quite well, namely compressing the text file size from 80 bits to 40 bits with a compression ratio of 50% reduction in size.
Penerapan Algoritma Arithmetic Coding Untuk Mengkompresi Record Database Pada Aplikasi Ensiklopedia Flora Berbasis Android Tari, Ratiya; Nasution, Surya Darma; Zebua, Taronisokhi
TIN: Terapan Informatika Nusantara Vol 2 No 7 (2021): Desember 2021
Publisher : Forum Kerjasama Pendidikan Tinggi (FKPT)

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

The use of a database in an application can affect the size of the application itself. The size of the database is influenced by the number of database records, so it requires a compression technique to compress database records in the flora encyclopedia application. Completion is done to reduce or reduce the size of a data so that the data size becomes smaller and with compression makes it easier to transmit. Many algorithms are developed in the compression process, one of which is the arithmetic coding algorithm. Performance measurement of compression results by applying the arithmetic coding algorithm in compressing the flora encyclopedia application database records, namely producing Ratio of compression (2.2), Compression Ratio (45%), and Redundancy (55%).
Decision Support System for The Selection of North Sumatra Atlet Drumband By Applying Elimination and Choice Translation Reality (ELECTRE) (Case Study: United States of Drumband Indonesia North Sumatra Region) S Sunaryo; Natalia Silalahi; M Mesran; Surya Darma Nasution; Guidio Leonarde Ginting
IJISTECH (International Journal of Information System and Technology) Vol 4, No 1 (2020): November
Publisher : Sekolah Tinggi Ilmu Komputer (STIKOM) Tunas Bangsa

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30645/ijistech.v4i1.93

Abstract

Unity Drumband Indonesia (PDBI) Region of North Sumatra is an organizational body engaged in sports groups, which involves players in various musical instruments. In selecting players, PDBI North Sumatra through the committee to conduct strict selection, through a judging system with several stages of a rigorous process. From the selection of participants, compare each criterion one by one to get the best athletes. Implementation of decision support systems is expected to provide the right solution and can assist the jury in generating a decision. Thus the process of selecting athletes can produce a decision directly without a long time. So that accelerate the selection process of drum band athletes who will strengthen the team of North Sumatra. The Elimination and Choice Translation Reality (ELECTRE) method is required in decision support systems for the selection of drum band athletes who will strengthen the North Sumatra team.
Modifikasi Algoritma Fisher Yates Shuffle Menggunakan Linear Congruent Method Untuk Pembangkitan Bilangan Acak Surya Darma Nasution; Suginam Suginam
Jurnal Ilmu Komputer Vol 12 No 2 (2019): Jurnal Ilmu Komputer
Publisher : Informatics Department, Faculty of Mathematics and Natural Sciences, Udayana University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (178.598 KB) | DOI: 10.24843/JIK.2019.v12.i02.p01

Abstract

Pembangkit bilangan acak digunakan untuk menghasilkan urutan-urutan dari angka-angka sebagai hasil dari suatu perhitungan dengan komputer yang diketahui distribusinya sehingga angka-angka yang dihasilkan akan muncul secara acak. Masalah yang ada pada suatu algoritma pembangkit bilangan acak adalah apakah algoritma tersebut dapat menghasilkan angka-angka yang acak. Linear congruent method memiliki kekurangan yaitu hasil bilangan acak yang dihasilkan berpola dan algoritma fisher yates shuffle memiliki kekurangan yaitu untuk menghasilkan bilangan acak membutuhkan algoritma pembangkit bilangan acak lainnya. Dengan memodifikasi algoritma fisher yates shuffle menggunakan linear congruent method diharapkan dapat menghasilkan menghasilkan bilangan acak.
Penerapan Algoritma Rice Codes dan Algoritma Rivest Shamir Adleman (RSA) Untuk Kompresi dan Pengamanan Teks Pada Aplikasi Chatting Vify Ernanda; Surya Darma Nasution; Fince Tinus Waruwu
Journal of Computer System and Informatics (JoSYC) Vol 1 No 3 (2020): Journal of Computer System and Informatics (JoSYC) - May 2020
Publisher : Forum Kerjasama Pendidikan Tinggi (FKPT)

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

With the development of information in this day and age chat plays an important role in all aspects of human life. Where chat as a communication tool that can help communicate without any time restrictions and is free from obstacles. But in communicating through chat applications can not be free or as free in communicating as usual. Where chat has a predetermined number of bits, so that in sending text messages the chat application cannot be at once or in one delivery but in multiple transmissions. Therefore the chat application requires a compression where the text messages to be sent through the chat application do not take a long time and do not send several times. It is enough to send only one text message to those addressed. But sometimes text messaging is not only a problem in many or few text messages to be sent there are other obstacles in sending text messages that must be overcome. Text messages that have been sent to those intended, sometimes the text messages have changed not at its disposal or not the same as what was sent. Therefore the chat application is in need of security on the chat application which can secure text messages to be sent to the intended destination without changing one bit. Chat applications provide solutions to communication problems because they are hampered by distance and time. Chat application provides convenience in communicating chat to several people who have great distances by applying the Rice Codes and Rivest Shamir Adleman (RSA) algorithm to chat applications that are designed using Miscrosoft Visual Basic 2008 programming language as a means of compressing and securing text messages.
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