Claim Missing Document
Check
Articles

Found 16 Documents
Search

Ekstraksi Kata Kunci pada Bahasa Indonesia Menggunakan Metode Yake Yusliani, Novi; Plakasa, Gerald; Abdiansah, Abdiansah; Marieska, Mastura Diana; Saputra, Danny Matthew
Jurnal Linguistik Komputasional Vol 6 No 1 (2023): Vol. 6, NO. 1
Publisher : Indonesia Association of Computational Linguistics (INACL)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26418/jlk.v6i1.117

Abstract

Peneliti, Mahasiswa, dan Juga Dosen biasanya melakukan penelitian untuk menghasilkan publikasi hasil penelitiannya. Saat ini pertumbuhan publikasi ilmiah terus meningkat. ketika publikasi akan di berikan ke reviewer maka publikasi yang kirimkan harus sesuai dengan bidang yang diampu oleh reviewer tersebut. Salah satu cara untuk mengetahui inti dari sebuah publikasi ilmiah yaitu dengan melakukan ekstraksi kata kuncinya. Metode yang digunakan untuk ekstraksi kata kunci salah satunya yaitu YAKE (Yet Another Keyword Extraction). Penelitian ini menggunakan dataset 100 publikasi ilmiah dari website jtiik, jatisi, dan jepin dengan topik Ilmu Komputer. Berdasarkan penelitian yang telah dilakukan, konfigurasi pada parameter Levenshtein Distance memiliki pengaruh terhadap hasil kata kuncinya. Evaluasi dari penelitian ini menghasilkan nilai f-measure sebesar 54,1% dan nilai akurasi sebesar 97,05% dengan parameter Levenshtein Distance < 2.
Perbandingan Metode Mapreduce Berbasis Single Node Hadoop Pada Aplikasi Word Count Marieska, Mastura Diana; Utami, Alvi Syahrini; Oktaviani, Elvira
JUPITER (Jurnal Penelitian Ilmu dan Teknologi Komputer) Vol 16 No 1 (2024): Jurnal Penelitian Ilmu dan Teknologi Komputer (JUPITER)
Publisher : Teknik Komputer Politeknik Negeri Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5281/zenodo.11097045

Abstract

In the context of Big Data processing, Hadoop MapReduce serves as a framework used to develop software and process large-scale data in parallel. Word Count is a type of task used to count the occurrences of unique words in a text file. Considering processing time is crusial in adhering to standards of Big Data Processing. The conducted research involved the processing of text files using the MapReduce method on the Hadoop Distributed File System (HDFS) using a single node, comparing the results of Word Count processing with and without the use of MapReduce. The research findings indicate that the implementation of Word Count without using MapReduce offers better speed in processing Indonesian language text data on a Hadoop single node. Additionally, the comparison of processing time between the Word Count program with Hadoop MapReduce and the Word Count program without MapReduce shows that the latter has faster processing time. A significant reduction in processing time, up to 95% for a 5 MB file size, can be achieved by using the Word Count method without MapReduce. However, the level of reduction decreases with increasing file size.
Implementasi Game Hangman Multiplayer Menggunakan Socket dan Multithreading Berbasis Protokol TCP Marieska, Mastura Diana
The Indonesian Journal of Computer Science Vol. 13 No. 5 (2024): The Indonesian Journal of Computer Science (IJCS)
Publisher : AI Society & STMIK Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33022/ijcs.v13i5.4384

Abstract

Multiplayer games tend to be more engaging and can offer a more enjoyable experience compared to single-player games. Hangman, a word-guessing game, is commonly played in groups. When players are in different locations, a reliable connection mechanism is crucial to maintain uninterrupted gameplay. In this study, the Hangman game was implemented using socket programming and multithreading. Sockets were used as the connection mechanism between the players and the server. TCP protocol, which is reliable, was used in this implementation to maintain integrity of communication between clients and server. To allow multi players to participate simultaneously, multithreading was implemented. On the server side, each connected client was assigned a dedicated thread, allowing independent and parellel communication between server and each client. Blackbox testing result indicate that all features of the Hangman game were succesfully implemented and functioned properly.
Aplikasi QR-code untuk sistem daftar hadir: Solusi digitalisasi administrasi di SMA dan SMK Rodiah, Desty; Yusliani, Novi; Abdiansah; Utami, Alvi Syahrini; Miraswan, Kanda Januar; Marieska, Mastura Diana; Yunita; Rini, Dian Palupi
Jurnal Inovasi Hasil Pengabdian Masyarakat (JIPEMAS) Vol 8 No 2 (2025): Jurnal Inovasi Hasil Pengabdian Masyarakat (JIPEMAS)
Publisher : University of Islam Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33474/jipemas.v8i2.22696

Abstract

Kebijakan Merdeka Belajar dari Kemendikbud RI mendorong guru untuk menerapkan pendekatan pengajaran yang fleksibel dan adaptif melalui integrasi teknologi dalam kegiatan pembelajaran. Dalam konteks ini, program pengabdian kepada masyarakat memberikan pelatihan untuk mengembangkan sebuah aplikasi daftar hadir berbasis QR-Code menggunakan Python untuk guru SMA dan SMK. Aplikasi ini dirancang untuk mencatat kehadiran siswa secara cepat, tepat, dan efisien, serta mendukung kemudahan administrasi dan memberikan pengalaman langsung dalam penggunaan teknologi pemrograman. Kegiatan pengabdian ini menerapkan metode Participatory Action Research (PAR), yang meliputi lima tahap: To Know (menggali kebutuhan mitra melalui survei), To Understand (mengevaluasi pelatihan sebelumnya), To Plan (menyusun materi dan instrumen evaluasi), To Act (melaksanakan pelatihan melalui presentasi dan praktikum), dan To Change (melakukan evaluasi). Evaluasi dilakukan dengan pendekatan N-Gain dan skala Likert. Hasil N-Gain sebesar 20,90% menunjukkan efektivitas pelatihan yang kurang meskipun terdapat peningkatan nilai rata-rata sebesar 7,37 poin. Hal ini dipengaruhi oleh latar belakang peserta yang sudah berpengalaman, sehingga materi dan soal perlu dikembangkan lebih lanjut. Di sisi lain, hasil Likert menunjukkan persepsi peserta yang sangat positif. Kendala koneksi internet sempat memengaruhi praktikum, namun narasumber dan mahasiswa aktif membantu peserta yang mengalami hambatan tersebut.
Performance Comparison of Monolithic and Microservices Architectures in Handling High-Volume Transactions Marieska, Mastura Diana; Arya Yunanta; Harisatul Aulia; Alvi Syahrini Utami; Muhammad Qurhanul Rizqie
Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi) Vol 9 No 3 (2025): June 2025
Publisher : Ikatan Ahli Informatika Indonesia (IAII)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.29207/resti.v9i3.6183

Abstract

Monolithic and microservices are two distinct approaches for designing and developing applications. However, these architectures exhibit contrasting characteristics. In monolithic architecture, all components of an application form a unified entity with closely interconnected parts, whereas microservices decompose an application into independent, lightweight services that can be developed, deployed, and updated separately. Microservices are often regarded as superior to monolithic architectures in terms of their performance. This study aims to compare the performance of monolithic and microservices architectures in handling a high volume of transactions. It is important to observe how the two architectures behave when handling transactions from a large number of concurrent users. A prototype of an online ticketing system was implemented for both architectures to enable comparative analysis. The selected performance metrics were response time and error rate. The experimental results reveal that under high-load conditions, microservices outperform monolithic architectures, demonstrating 36% faster response times and 71% fewer errors. However, under overload conditions—when CPU usage exceeds 90%—the performance of microservices degrades significantly. This does not imply that microservices cannot handle a large number of concurrent users but highlights the necessity for enhanced resource management.
Query Reformulation for Indonesian Question Answering System Using Word Embedding of Word2Vec Utami, Alvi Syahrini; Yusliani, Novi; Marieska, Mastura Diana; Abdiansyah
Computer Engineering and Applications Journal (ComEngApp) Vol. 11 No. 1 (2022)
Publisher : Universitas Sriwijaya

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

Abstract

Query reformulation is one of the tasks in Information Retrieval (IR), which automatically creates new queries based on previous queries. The main challenge of query reformulation is to create a new query whose meaning or context is similar to the old query. Query reformulation can improve the search for relevant documents for Open-domain Question Answering (OpenQA). The more queries are given to the search system, and the more documents will be generated. We propose a Word Predicted and Substituted (WPS) method for query reformulation using a word embedding word2vec. We tested this method on the Indonesian Question Answering System (IQAS). The test results obtained an E-1 value of 81% and an E-2 value of 274%. These results prove that the query reformulation method with WPS and word-embedding can improve the search for potential IQAS answers.