Garuda - Garba Rujukan Digital

Implementasi Keamanan Jaringan Hotspot dengan Metode Address List pada RB MikroTik di SMKIT Nurul Qolbi Ilham Anwar Ramadhan; Rakhmat Purnomo; Sri Rejeki
Journal of Students‘ Research in Computer Science Vol. 3 No. 2 (2022): November 2022
Publisher : Program Studi Informatika Fakultas Ilmu Komputer Universitas Bhayangkara Jakarta Raya

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31599/jsrcs.v3i2.639

SMKIT Nurul Qolbi uses the internet as a means of promotion, marketing, learning and practical communication to teachers, students, and school employees. But the SMKIT Nurul Qolbi network has not implemented hotspot network security in sharing and managing internet connections to teachers, students, and school staff computers. Without hotspot network security, many computers use the internet irregularly, causing other computers to not get a fair share of internet access. Due to the uneven internet connection, this causes disruption of school operations, so that it has an impact on the school's losses, both material and managerial. The absence of hotspot network security at SMKIT Nurul Qolbi is exacerbated by the large number of teachers, students, and school employees who do not use the internet to access needs related to work and learning. There are still many teachers, students, and school employees who use the internet to access social media sites such as Facebook, Twitter, and other sites that have nothing to do with work and learning, making the hotspot internet ineffective at Nurul Qolbi's SMKIT. Therefore, to maximize internet access found at SMKIT Nurul Qolbi, hotspot network security is needed. With hotspot network security, it is hoped that all computers can use the internet smoothly and stably even though all computer units use the internet at the same time and with hotspot network security it is hoped that it can increase the productivity of teachers, students and school employees. Keywords: Address list, Hotspot, Network Security Abstrak SMKIT Nurul Qolbi menggunakan internet sebagai sarana untuk melakukan promosi, pemasaran, pembelajaran dan komunikasi yang praktis kepada Guru, Siswa, dan pegawai sekolah. Tetapi pada jaringan SMKIT Nurul Qolbi belum menerapkan keamanan jaringan hotspot dalam membagi dan mengatur koneksi internet kepada komputer Guru, Siswa, dan pegawai sekolah. Tanpa adanya keamanan jaringan hotspot banyak komputer yang menggunakan internet secara tidak beraturan sehingga menyebabkan komputer yang lain tidak mendapat jatah akses internet yang adil. Karena koneksi internet yang tidak merata, hal ini menyebabkan terganggunya operasional kegiatan sekolahan, sehingga berdampak pada ruginya sekolah baik dari material maupun manajerial. Belum adanya keamanan jaringan hotspot pada SMKIT Nurul Qolbi diperparah dengan banyaknya Guru, Siswa, dan pegawai sekolah yang menggunakan internet tidak untuk mengakses kebutuhan yang berhubungan dengan pekerjaan dan pembelajaran. Masih banyak Guru, Siswa, dan pegawai sekolah yang menggunakan internet untuk mengakses situs-situs social media seperti facebook, twitter, maupun situs-situs lainnya yang tidak ada kaitannya dengan pekerjaan dan pembelajaran, membuat tidak efektifnya jaringan hotspot yang ada SMKIT Nurul Qolbi tersebut. Oleh sebab itu untuk memaksimalkan akses internet yang terdapat pada SMKIT Nurul Qolbi diperlukan keamanan jaringan hotspot. Adanya keamanan jaringan hotspot sangat diharapkan semua komputer dapat menggunakan internet dengan lancar dan stabil walaupun semua unit jaringan komputer menggunakan internet dalam waktu yang bersamaan serta dengan adanya keamanan jaringan hotspot diharapkan dapat meningkatkan produktifitas dari Guru, Siswa, dan Pegawai Sekolah. Kata kunci: Address list, Hotspot, Keamanan jaringan

Prediksi Persediaan Material Menggunakan Metode Single Exponential Smoothing noeman noeman; Fadhila Fajri Putri; Rakhmat Purnomo; Robertus Suraji
Journal of Practical Computer Science Vol. 2 No. 2 (2022): November 2022
Publisher : DPPM Universitas Pelita Bangsa

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.37366/jpcs.v2i2.1468

Material is an important material in manufacturing companies that make components of an item. Used to make various components which are then processed on injection machines. This of course makes warehouse and Production Planing Inventory Control (PPIC) employees have to see and ensure that the availability of materials can be fulfilled for several days or months, then make planning for spending or using materials if the existing materials have reached the availability limit. , and also inconsistent data such as lack of material. The purpose of this study is to find out how much material inventory is for the next 1 period. The method used is Single Exponential Smoothing with a constant of 0.9. Provision of constants for calculations from the High Impact Polystyrene (HIPS) 495F NATURAL material data sample which is applied to 3 other types of materials. The result of this research is that for PBT DURANEX 3300 NATURAL, the result is 777.01 with MSE 2880745.72, MAD 489.96 and MAPE 0.074%. ABS material type TOYOLAC T500-322 NATURAL got 2813.18 results with MSE 342161.98, MAD 168.85, and MAPE 0.092%. Material Type AS STYLAC 769 6A-X8113 IVORY got 663.46 results with MSE 222210.16, MAD 136.07, and MAPE 0.092%.

Comparison Between Simple Round Robin and Improved Round Robin Algorithms Tri Dharma Putra; Rakhmat Purnomo
JATISI (Jurnal Teknik Informatika dan Sistem Informasi) Vol 10 No 1 (2023): JATISI (Jurnal Teknik Informatika dan Sistem Informasi)
Publisher : Lembaga Penelitian dan Pengabdian pada Masyarakat (LPPM) STMIK Global Informatika MDP

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35957/jatisi.v9i3.2547

The objective of this journal is to compare the efficiency between these two algorithms, the simple round robin and improved round robin algorithms. In real time systems algorithm, round robin plays a significant role to be used in embedded systems. Here we compare the average turn around time and average waiting time, also number of context switching between these two algorithms. Improved round robin algorithm, is an algorithm where if the remaining burst time is less than the allocated time quantum then the running process is executed. Then remove the currently running process from ready queue and put it in the tail of the ready queue while in simple round robin algorithm the remaining burst time will be executed until finish as scheduled. This comparison proves that improved round robin algorithm is more efficient, with lower average turn around time and lower average waiting time, lower context switching. There by this increases the system throughput.

Comparison Between Simple Round Robin and Improved Round Robin Algorithms Tri Dharma Putra; Rakhmat Purnomo
JATISI (Jurnal Teknik Informatika dan Sistem Informasi) Vol 10 No 1 (2023): JATISI (Jurnal Teknik Informatika dan Sistem Informasi)
Publisher : Lembaga Penelitian dan Pengabdian pada Masyarakat (LPPM) STMIK Global Informatika MDP

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35957/jatisi.v10i1.4824

The objective of this journal is to compare the efficiency between these two algorithms, the simple round robin and improved round robin algorithms. In real time systems algorithm, round robin plays a significant role to be used in embedded systems. Here we compare the average turn around time and average waiting time, also number of context switching between these two algorithms. Improved round robin algorithm, is an algorithm where if the remaining burst time is less than the allocated time quantum then the running process is executed. Then remove the currently running process from ready queue and put it in the tail of the ready queue while in simple round robin algorithm the remaining burst time will be executed until finish as scheduled. This comparison proves that improved round robin algorithm is more efficient, with lower average turn around time and lower average waiting time, lower context switching. There by this increases the system throughput.

THE IMPACT FACTORS OF CORPORATE SOCIAL RESPONSIBILITY DISCLOSURE Maidani Maidani; Murti Wijayanti; Rakhmat Purnomo
TRIKONOMIKA Vol 19 No 2 (2020): December Edition
Publisher : Faculty of Economics and Business, University of Pasundan

This research study purpose is to analyze the impact of profitability, independent members of commissioner board, leverage and public shareholders on Corporate Social Responsibility (CSR) Disclosure by using 27 companies listed on Indonesia stock exchange and publishing Sustainability Report for the year during 2015 – 2017 as a sample. Using multiple linear regression as data analysis method, the results show that the proportion of independent board of commissioner of their existence can be a counterweight to various parties so as to encourage companies to disclose CSR, while the higher leverage level, the more likely the company will violate the credit agreement so that the company will seek to report higher earnings now. Therefore, in order for reported earnings to be high, the manager reduces costs, including the costs of disclosure of social responsibility. While profitability, and public share ownership have no effect on CSR Disclosure.

Metode DCT-Transformasi dalam Watermarking Video dengan Konsep 3-Dimensi Ajif Yunizar Pratama Yusuf; Rakhmat Purnomo
PROSIDING SNITek Vol. 3 (2021): SEMINAR NASIONAL INOVASI TEKNOLOGI (SNITek) 2021
Publisher : FT-TEKNIK USNI

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.59134/prosidng.v3i.292

Watermarking adalah suatu metode yang digunakan dalam pengamanan hak otentikasi suatu gambar atau video. Oleh karena semakin meningkatnya jumlah pengiriman atau penggandaan suatu karya gambar atau video melalui internet, menyebabkan timbulnya permasalahan baru yaitu bagaimana membuktikan hak kepemilikan dari suatu citra digital (gambar atau video). Pada penelitian ini diterapkan suatu metode yang aman dalam menerapkan watermarking pada video dengan menggunakan Discrete Cosine Transform (DCT) pada domain frekuensi. Video merupakan susunan dari sejumlah frame, dimana setiap frame dianggap sebagai suatu citra tak bergerak (gambar). Penanaman watermark pada video memiliki tantangan tersendiri, dimana watermark di tanamkan ke beberapa atau semua frame yang ada pada video. Adapun konsep 3-Dimensi yang diterapkan memberikan efisiensi dalam menanamkan watermark pada seluruh frame dari suatu video bahkan dengan durasi yang sangat panjang sekalipun. Hasil penelitian ini menunjukkan bahwa metode watermarking video dengan konsep 3-dimensi dapat menjadi salah satu opsi untuk mengamankan hak otentikasi dari suatu video.

Analisis Algoritma Round Robin pada Penjadwalan CPU: Algoritma Scheduling CPU Tri Dharma Putra; Rakhmat Purnomo
Jurnal Ilmiah Teknologi Informasi Asia Vol 15 No 2 (2021): Volume 15 Nomor 2 (8)
Publisher : LP2M INSTITUT TEKNOLOGI DAN BISNIS ASIA MALANG

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.32815/jitika.v15i2.481

ABSTRACT. Scheduling is a key concept in computer multitasking and multiprocessing operating system design and in real-time operating system design by switching the CPU among process. Round Robin Algorithm is a wellknown algorithm in CPU scheduling. Round Robin Algorithm provides a time quantum between context switching. Choosing the time quantum in Round Robin Algorithm is very crucial, large quantum time will result in lower context switching, while small quantum time wil result in higher context switching. For waiting time, the idea for waiting time is to get smaller waiting time which is more efficient. Turn around time also should be minimum, which is more efficient. Two case studies are discussed to understand this algorithm more deeply. We did analysis with data set process 1 till process 5 (P1-P5), with burst time dataset: 20ms, 34ms, 25ms, 62ms, 67ms. In case study 1, we use quantum 25m, and in case study 2, we use quantum 15ms. Context switching in case study 2 is 17 where on case study 1, only 10 context switchings. Total burst-time in case study 1 and case study 2 are 208 ms. Average waiting time in case study 1 is 82 ms, where in case study 2 is 105.8 ms. Average Turn Around Time in case study 1 is 123.6ms, where in case study 2 is 146.6 ms. Keywords: Round Robin Algorithm, quantum time, context switching, average waiting time, average turn around time

Title

Found 17 Documents
Search

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title Search

Found 17 Documents Search

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title

Found 17 Documents
Search