cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Soeb Aripin
Contact Email
suefarifin@gmail.com
Phone
+6282370070808
Journal Mail Official
mesran.skom.mkom@gmail.com
Editorial Address
Jalan sisingamangaraja No 338 Medan, Indonesia
Location
Kota medan,
Sumatera utara
INDONESIA
Jurnal Sains dan Teknologi Informasi
Published by Forum Kerjasama Pendidikan TInggi
ISSN : -     EISSN : 2809610X     DOI : https://doi.org/10.47065/jussi.v3i2.4883
Core Subject : Science, Engineering,
Computer Science & IT Control & Systems Engineering Electrical & Electronics Engineering
Bidang kajian dari Jurnal Sains dan Teknologi Informasi, yaitu: Teknik Informatika, Manajemen Informatika, Sistem Informasi, Teknik Komputer, Kecerdasan Buatan, dan Computer Science.
Arjuna Subject : Ilmu Komputer (semua kategori) - Ilmu Komputer (Lain-Lain)
Articles 5 Documents
 1 
Search results for , issue "Vol 3 No 3 (2024): Juni 2024" : 5 Documents clear
Kombinasi Metode ADDIE Dan CBL Dalam Merancang Aplikasi Pembelajaran Kimia Pada Sekolah Menengah Atas Sihotang, Marta Nofita
Jurnal Sains dan Teknologi Informasi Vol 3 No 3 (2024): Juni 2024
Publisher : Forum Kerjasama Pendidikan Tinggi (FKPT)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/jussi.v3i3.7690

Abstract

Learning is a process of interaction between students and educators and learning resources in a learning environment that includes teachers and students exchanging information. Learning is also a process to help students learn well. In the context of education, the teacher teaches a lesson so that students can learn and master the content of the lesson to achieve a specified objective, can also influence changes in attitudes, as well as the skills of a learner, but this teaching process gives the impression of only being the work of one party, namely the work of teacher only. The ADDIE and CBL methods are methods used to design a computerized and multimedia-based learning application. In addition to the CBI, CAI, and other learning methods, the ADDIE and CBL methods are also suitable methods for use in learning systems that will make it easier for teachers to convey material. One way of computer-assisted learning is the application of the ADDIE and CBL methods. The ADDIE method is a learning system design model that shows the basic stages of a learning system that are simple and easy to learn. While the CBL method is learning that fully uses a computer. In the process of computer-assisted learning, where the computer is used for the purpose of presenting learning in the form of tutorials, simulations and games. This can really help students to be able to implement a learning while playing system that is very effective for the learning process for students.
Sistem Pengambilan Keputusan Pemilihan Tempat Wisata di Serdang Bedagai Dengan Modifikasi Metode MAUT Dan MOORA Virgustiawan, Muhammad
Jurnal Sains dan Teknologi Informasi Vol 3 No 3 (2024): Juni 2024
Publisher : Forum Kerjasama Pendidikan Tinggi (FKPT)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/jussi.v3i3.7691

Abstract

The beauty of tourist attractions is of course one of the main goals of tourists in Serdang Bedagai in spending their holidays and apart from beauty, there are many other things that attract tourists. The increasing number of tourist attractions and different beauties in Serdang Bedagai, as well as the absence of a system that provides information on priority tourist attractions that are really worth visiting, makes it difficult for tourists to determine the best tourist attraction based on the completeness of the facilities and the beauty of the tourism they will visit. they visit. Based on this problem, a decision support system was designed using a combination of Multi Attribute Utility Theory (MAUT) and Multi-Objective Optimization On The Basis Of Ratio Analysis (MOORA) methods. The results of testing the selection of the best tourist attraction in Serdang Bedagai with the Decision Support System were able to quickly provide decision results for the best tourist attraction in Serdang Bedagai Regency, where with a sample of 5 tourist data it was found that the tourist with the first rank was A4 "Sustainable Bali Beach" with an SPK value of 0.498512.
Kompresi File Video Menggunakan Algoritma Punctured Elias Code Rangkuti, Tondhita Syah Nur
Jurnal Sains dan Teknologi Informasi Vol 3 No 3 (2024): Juni 2024
Publisher : Forum Kerjasama Pendidikan Tinggi (FKPT)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/jussi.v3i3.7692

Abstract

Video files are large in size, especially if they are high quality and have an MP4 extension. The MP4 extension is a minimally compressed format. This poses a problem in the processing of video files and also requires a large amount of storage space. If a video file is large in size, it can affect the file transfer process. Therefore, the file transfer process has two possible outcomes: the video file may take a long time to transfer, or the transfer may fail due to the file size exceeding the maximum storage limit. This issue can be resolved by compressing the video file data. Data compression reduces the storage size of the file on both internal and external memory, thereby accelerating the transfer process as the file size becomes smaller. Data compression has several algorithms that can be used. In this study, the author uses the punctured Elias code algorithm, which is a lossless compression technique, so that the decompressed result of the compressed data is the same as the original data. The design of this system consists of two main processes: the compression process and the decompression process, as well as the process of calculating the performance metrics of the Compression Ratio (RC), Compression Ratio (CR), and Redundancy. In the compression process of a colored video file with the MP4 extension using the Additive Code algorithm, the Ratio of Compression (RC) was 1.52, the Compression Ratio (CR) was 65%, and the Redundancy was 34%. In this video file compression research using the punctured Elias code algorithm, it is hoped that it can help users compress large video files into smaller ones.
Sistem Pendukung Keputusan Penerimaan Karyawan Menggunakan Metode WASPAS dengan Pembobotan Metode ROC Sinaga, Ferdinan Ganda Saputra; Simamora, Burju Francisko
Jurnal Sains dan Teknologi Informasi Vol 3 No 3 (2024): Juni 2024
Publisher : Forum Kerjasama Pendidikan Tinggi (FKPT)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/jussi.v3i3.7693

Abstract

In a company, hiring the best employees is quite important, as it can affect the level of profit or loss experienced by a company. This has led company management to make every effort to determine the best employees in order to make the right choice. Therefore, the author will create a decision support system that can be used as a reference in hiring the best employees. The method used in this study is the WASPAS (Weight Agregate Sum Product Assessment) method with ROC (Rank Order Centroid) weighting. By applying these two methods, it is hoped that the best possible results will be obtained in determining the best employees to hire. Based on this issue, a Decision Support System (DSS) needs to be developed to support the employee selection process, by applying the WASPAS method with ROC method weighting. The WASPAS method is a method that can reduce errors or optimize estimations for selecting the highest and lowest values. Thus, the main objective of the MCDM approach is to select the best option from a set of alternatives in the face of conflicting criteria. The ROC method is based on the level of importance or priority of the criteria, and the ROC technique assigns weights to each criterion according to the ranking assessed based on the level of priority. In this study, the method applied to generate the best employee acceptance decision is the Weight Aggregated Sum Product Assessment (WASPAS) with ROC method weighting. This method was chosen because it is a decision support model where the main tool is a functional hierarchy with the main input being human perception, in this case, experts in the field or those who understand the issues of selecting the best employees at CV Sihol Pardomuan.
Analisa Perbandingan Algoritma Unary Code Dan Algoritma Prefix Code Untuk Kompresi File PDF Radiah, Apni Radiah
Jurnal Sains dan Teknologi Informasi Vol 3 No 3 (2024): Juni 2024
Publisher : Forum Kerjasama Pendidikan Tinggi (FKPT)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/jussi.v3i3.7694

Abstract

A pdf file (Portable Document Format) is a type of document or file format for digital document exchange purposes. Problems with pdf files often occur when we send files with a large capacity so that the process of sending files is wasteful and it will take a long time in the process of sending pdf files. In overcoming this problem, you have to do a compression technique first so that the pdf file saves on sending files. After carrying out the compression process, you will get a smaller file than before. And the goal is to save storage space and also speed up the shipping process.In the compression process, the Prefix Code Algorithm has better compression results than the Unary Code Algorithm, namely the Prefix Code Algorithm obtains a total value of 5.420% while the Unary Code Algorithm obtains a total value of 5.220% in compressing Pdf files. The Prefix Code algorithm obtains greater results compared to the Unary Code algorithm. So the conclusion is that the Prefix Algorithm is better than the Unary Code Algorithm for compressing Pdf files.

Page 1 of 1 | Total Record : 5

 1 

Filter by Year

2024 2024


Reset
Filter By Issues
All Issue Vol 5 No 1 (2025): Desember 2025 Vol 4 No 4 (2025): September 2025 Vol 4 No 2 (2025): Maret 2025 Vol 4 No 1 (2024): Desember 2024 Vol 3 No 4 (2024): September 2024 Vol 3 No 3 (2024): Juni 2024 Vol 3 No 2 (2024): Maret 2024 Vol 3 No 1 (2023): Desember 2023 Vol 2 No 4 (2023): September 2023 Vol 2 No 3 (2023): Juni 2023 Vol 2 No 2 (2023): Maret 2023 Vol 2 No 1 (2022): Desember 2022 Vol 1 No 4 (2022): September 2022 Vol 1 No 3 (2022): Juni 2022 Vol 1 No 2 (2022): Maret 2022 Vol 1 No 1 (2021): Desember 2021 More Issue