Claim Missing Document
Check
Articles

Found 3 Documents
Search

BekasMart: Marketplace C2C Berbasis Web dengan Fitur Lelang dan Penjualan Langsung Nafil Rizq Trianto; Azril Arfansyah; Arion Pardede; Debi Yandra Niska
JASIEK (Jurnal Aplikasi Sains, Informasi, Elektronika dan Komputer) Vol. 8 No. 1 (2026): Juni 2026
Publisher : Universitas Merdeka Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26905/jasiek.v8i1.17157

Abstract

Customer to Customer (C2C) transactions on social media were often hindered by manual bid recapitulation and bid-and-run fraud risks due to the absence of an integrated platform. This study designed and developed a web-based C2C marketplace information system named BekasMart, integrating direct sales and auction features using a Guest System architecture. The Waterfall method was applied, covering requirements analysis, system design using Unified Modeling Language (UML), implementation with the CodeIgniter 4 framework, and Black Box Testing. Results demonstrated that the Guest System architecture, based on WhatsApp number validation, successfully facilitated transactions without conventional login bureaucracy. Transaction security was maintained through an Escrow (Rekber) mechanism and WhatsApp Direct Link integration. Functional testing confirmed the system processed bids automatically with a 100% success rate.
Perbandingan Algoritma Greedy dan Dynamic Programming pada Penyelesaian Knapsack Problem untuk Optimasi Pemilihan Barang Khairany Zuhriyyah Jinan Hsb; Augis Dinanti; Muhammad Iqbal fahrezzi; Arion Pardede; Adidtya Perdana
Teknik: Jurnal Ilmu Teknik dan Informatika Vol. 6 No. 1 (2026): Mei : Teknik: Jurnal Ilmu Teknik dan Informatika
Publisher : LPPM Sekolah Tinggi Ilmu Ekonomi - Studi Ekonomi Modern

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.51903/teknik.v6i1.1127

Abstract

Optimization problems in computer science often arise when a system must select the best combination from several alternatives under limited resources such as capacity, time, or cost. One commonly used optimization model is the Knapsack Problem, which involves selecting a number of items with specific weights and values to obtain the maximum profit without exceeding the available capacity. This study aims to analyze and compare the performance of the Greedy algorithm and Dynamic Programming in solving the 0–1 Knapsack Problem. The research employs a quantitative experimental approach by implementing both algorithms in a computer program and testing them on several datasets with different sizes. The evaluation parameters include the maximum value obtained and the algorithm execution time. The results show that the Greedy algorithm has faster execution time and more efficient memory usage, but it does not always produce an optimal solution. In contrast, the Dynamic Programming algorithm consistently produces an optimal solution, although it requires greater computational time. Therefore, the choice of algorithm should be adjusted to system requirements, whether prioritizing computational efficiency or optimal solution quality.
Sentralisasi Manajemen Multi-Router MikroTik Berbasis Web Melalui REST API pada Lingkungan Virtualisasi Azril Arfansyah; Dedy Kiswanto; Muhammad Iqbal Fahrezzi; Arion Pardede
BETRIK Vol. 17 No. 02 (2026): Jurnal Ilmiah BETRIK : Besemah Teknologi Informasi dan Komputer
Publisher : PPPM Institut Teknologi Pagar Alam

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.36050/z6vfkq27

Abstract

Conventional management of MikroTik-based network infrastructure still relies on desktop-bound applications such as Winbox and Command Line Interface (CLI) that require per-device manual configuration, causing operational inefficiencies and the inability to provide centralized real-time visibility. This study develops a web-based Network Management System (NMS) leveraging the built-in REST API of MikroTik RouterOS version 7 to automate and centralize the configuration and monitoring of multiple routers within a single dashboard. The system is built on a three-tier architecture: a React 19-based frontend with Vite bundler, a Node.js and Express.js-based backend proxy, and an SQLite database layer. Evaluation was conducted in two stages: Black Box Testing for module functionality validation, and quantitative performance testing covering API endpoint response times, concurrent throughput, and multi-router scalability simulation. Results indicate that all 17 main API endpoints respond with an average time of 18.69 ms and a request success rate of 100% out of 1,404 total requests, with a communication failure rate of 0.00%. Scalability tests with 1 to 30 routers demonstrate sub-linear time growth through parallel and asynchronous execution mechanisms, with a total processing time of 185.98 ms for 30 simultaneous routers and a parallelization efficiency of 2.92x. The primary contribution of this study is the empirical demonstration that a Node.js proxy architecture exploiting RouterOS v7 REST API effectively scales multi-router configuration operations with measurable efficiency, while simultaneously integrating WireGuard VPN automation with server-side cryptographic management in a single platform.