cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Mesran
Contact Email
mesran.skom.mkom@gmail.com
Phone
+6282370070808
Journal Mail Official
jurnal.bulletincsr@gmail.com
Editorial Address
Jalan sisingamangaraja No 338 Medan, Indonesia
Location
Kota medan,
Sumatera utara
INDONESIA
Bulletin of Computer Science Research
Published by Forum Kerjasama Pendidikan TInggi
ISSN : -     EISSN : 27743659     DOI : -
Core Subject : Science,
Computer Science & IT
Bulletin of Computer Science Research covers the whole spectrum of Computer Science, which includes, but is not limited to : • Artificial Immune Systems, Ant Colonies, and Swarm Intelligence • Bayesian Networks and Probabilistic Reasoning • Biologically Inspired Intelligence • Brain-Computer Interfacing • Business Intelligence • Chaos theory and intelligent control systems • Clustering and Data Analysis • Complex Systems and Applications • Computational Intelligence and Soft Computing • Distributed Intelligent Systems • Database Management and Information Retrieval • Evolutionary computation and DNA/cellular/molecular computing • Expert Systems • Fault detection, Fault analysis, and Diagnostics • Fusion of Neural Networks and Fuzzy Systems • Green and Renewable Energy Systems • Human Interface, Human-Computer Interaction, Human Information Processing • Hybrid and Distributed Algorithms • High-Performance Computing • Information storage, security, integrity, privacy, and trust • Image and Speech Signal Processing • Knowledge-Based Systems, Knowledge Networks • Knowledge discovery and ontology engineering • Machine Learning, Reinforcement Learning • Networked Control Systems • Neural Networks and Applications • Natural Language Processing • Optimization and Decision Making • Pattern Classification, Recognition, speech recognition, and synthesis • Robotic Intelligence • Rough sets and granular computing • Robustness Analysis • Self-Organizing Systems • Social Intelligence • Soft computing in P2P, Grid, Cloud and Internet Computing Technologies • Support Vector Machines • Ubiquitous, grid and high-performance computing • Virtual Reality in Engineering Applications • Web and mobile Intelligence, and Big Data • Cryptography • Model and Simulation • Image Processing
Arjuna Subject : Ilmu Komputer (semua kategori) - Ilmu Komputer (Lain-Lain)
Articles 5 Documents
 1 
Search results for , issue "Vol. 2 No. 2 (2022): April 2022" : 5 Documents clear
Kombinasi Algoritma Cipher Block Chaining dan Triangle Chain Cipher dalam Penyandian File Text Nurul Hapifah Purba
Bulletin of Computer Science Research Vol. 2 No. 2 (2022): April 2022
Publisher : Forum Kerjasama Pendidikan Tinggi (FKPT)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/bulletincsr.v2i2.155

Abstract

Currently the use of information technology as a medium of information exchange is growing very widely. Various types of information such as text, images, sound and video can be converted into digital media that allows it to be reproduced or transmitted through various media. One of them is the internet, through the internet we can easily exchange information with other people in various places. However, there are times when information/messages are confidential, where no other party may know the contents of this information other than the sender and recipient. So we need a security against the message. Cryptography is a technique and art to encode messages or information in a medium, such as text, images, audio or video which aims to avoid suspicion from unauthorized people. For that we need a software that can encode confidential information in a text file. However, in hiding messages in text files using cryptography alone is not necessarily safe, so a useful algorithm is needed to improve security, therefore Cipher Block Chaining and Triangle Chain Cipher algorithms are needed. The research objective is to apply the Cipher Block Chaining and Triangle Chain Cipher algorithms for text file encoding applications. This is necessary because it often happens that the text message sent is a secret message that should not be known to just anyone. Block Chaining Ciphers and Triangle Chain Ciphers are useful algorithms to provide an advantage in terms of increased security in text files.
Implementasi Algoritma Set Partitioning in Hierarchical Trees (SPIHT) dan Algoritma Huffman Untuk Kompresi File Citra Lubis Irsan
Bulletin of Computer Science Research Vol. 2 No. 2 (2022): April 2022
Publisher : Forum Kerjasama Pendidikan Tinggi (FKPT)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/bulletincsr.v2i2.156

Abstract

As technology develops, the process of sending files no longer needs to be done manually. Data or files can be sent electronically via email. The image file size is sometimes very large, where the better the quality of the resulting image, the bigger the pixel size needed to record the image. With a very large image file size, the transfer process may fail, because the media storage space exceeds its limit. 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 compression is done by reducing the size of the image file by reducing the bits in the image file, but not eliminating the information data in it. By compressing, large data will be reduced in size so as to save storage space. In this study, the algorithm used is the Swiss army knife data compression, using this method, the compression results from the value of k have different compression results for each value, and the compression results will be beneficial in sending and moving image files more easily
Penerapan Algoritma Outguess dalam Penyembunyian Pesan Pada Citra Berwarna Yusni Elis Saragih
Bulletin of Computer Science Research Vol. 2 No. 2 (2022): April 2022
Publisher : Forum Kerjasama Pendidikan Tinggi (FKPT)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/bulletincsr.v2i2.157

Abstract

The storage or circulation of secret messages is vulnerable to being accessed or wiretapped by parties who do not have legal authority. Therefore, to avoid this and also to secure a secret message known an encryption process called cryptography. In order for the message to be kept confidential, the message is inserted into the image object. Inserting a message in an image or more commonly known as steganography is the development of previously known cryptographic methods. The method with steganography can be said to be better than the previous cryptography. To secure secret messages from unauthorized third parties, steganography is used
Analisis Tingkat Kepuasan Pelanggan dengan Menerapkan Algoritma C4.5 Reza Fauzy; Riki Winanjaya; Susiani
Bulletin of Computer Science Research Vol. 2 No. 2 (2022): April 2022
Publisher : Forum Kerjasama Pendidikan Tinggi (FKPT)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/bulletincsr.v2i2.162

Abstract

Furniture is currently a secondary item that is quite needed among the community to support their daily activities. In its use, furniture becomes an item that really helps human activities in their daily lives. But now furniture marketing is not only in terms of use, but now people have their own assessment of the aesthetic value of a furniture. So this is a demand for furniture business people to make variations on each product to be marketed. Customer satisfaction is one of the most important things in assessing the level of service provided by the company to its customers. The purpose of this study was to determine the level of satisfaction of CV. Karinda customers. at the company CV. This aspect of Karinda has not been measured, so CV. Karinda finds it difficult to determine which aspects must be improved. The method used in this study is the C 4.5 algorithm, where the data source used is a questionnaire/questionnaire technique given to CV. Karinda customers. the process of testing this research using RapidMinner software to create a decision tree. From the results of the analysis is expected to improve the company's performance in providing services to customers CV. Karinda to be better
Penerapan Data Mining dengan Algoritma C.45 Dalam Memprediksi Penjualan Tempe Yusuf Maulana; Riki Winanjaya; Fitri Rizki
Bulletin of Computer Science Research Vol. 2 No. 2 (2022): April 2022
Publisher : Forum Kerjasama Pendidikan Tinggi (FKPT)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/bulletincsr.v2i2.163

Abstract

Many people talk about business, benefits of business and the many different types of businesses that definitely have one purpose, financial profit or profit. With so many types of business as well as the benefits that can be taken from business, often we definitely feel we feel quickly to pave in the world of business to get profit or more specifically is income. One example of business is selling tempe. Sales is the activity of selling a product or service that needs business authorities or business acknowledgments of a kind of business selling tempe at mandiri ac. In selling of course we have a very many collection of sales information why we should be able to digest the sales information to become new data. In this issue the c4.5 algorithm is a procedure that can help digest or predicate the value of sales at the time to arrive. This research was tested in order to help sellers to predict the sales of their merchantability so that they can prepare or stock materials which is predicted to face an increase in their sales at the time of getting the information between supplied information. From this research can be conclusioned if using the c4.5 algorithm the sales of tempe can be predicted with a quite high accuracy

Page 1 of 1 | Total Record : 5

 1 

Filter by Year

2022 2022


Reset
Filter By Issues
All Issue Vol. 6 No. 1 (2025): December 2025 Vol. 5 No. 6 (2025): October 2025 Vol. 5 No. 5 (2025): August 2025 Vol. 5 No. 4 (2025): June 2025 Vol. 5 No. 3 (2025): April 2025 Vol. 5 No. 2 (2025): February 2025 Vol. 5 No. 1 (2024): December 2024 Vol. 4 No. 6 (2024): Oktober 2024 Vol. 4 No. 5 (2024): August 2024 Vol. 4 No. 4 (2024): June 2024 Vol. 4 No. 3 (2024): April 2024 Vol. 4 No. 2 (2024): Februari 2024 Vol. 4 No. 1 (2023): December 2023 Vol. 3 No. 6 (2023): October 2023 Vol. 3 No. 5 (2023): Agustus 2023 Vol. 3 No. 4 (2023): June 2023 Vol. 3 No. 3 (2023): April 2023 Vol. 3 No. 2 (2023): Februari 2023 Vol. 3 No. 1 (2022): Desember 2022 Vol. 2 No. 3 (2022): Agustus 2022 Vol. 2 No. 2 (2022): April 2022 Vol. 2 No. 1 (2021): Desember 2021 Vol. 1 No. 3 (2021): Agustus 2021 Vol. 1 No. 2 (2021): April 2021 Vol. 1 No. 1 (2020): Desember 2020 More Issue