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
+6282161108110
Journal Mail Official
ijics.stmikbudidarma@gmail.com
Editorial Address
Jalan Sisingamangaraja No. 338, Simpang Limun, Medan, Sumatera Utara
Location
Kota medan,
Sumatera utara
INDONESIA
The IJICS (International Journal of Informatics and Computer Science)
Published by Sekolah Tinggi Manajemen Informatika dan Komputer Budi Darma
ISSN : 25488449     EISSN : 25488384     DOI : https://doi.org/10.30865/ijics
Core Subject : Science, Engineering,
Computer Science & IT Control & Systems Engineering Electrical & Electronics Engineering
The The IJICS (International Journal of Informatics and Computer Science) covers the whole spectrum of intelligent informatics, which includes, but is not limited to : • Artificial Immune Systems, Ant Colonies, and Swarm Intelligence • Autonomous Agents and Multi-Agent Systems • 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 • Cognitive systems • 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 • Memetic Computing • Multimedia and Applications • 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 • Stochastic systems • Support Vector Machines • Ubiquitous, grid and high performance computing • Virtual Reality in Engineering Applications • Web and mobile Intelligence, and Big Data
Arjuna Subject : Ilmu Komputer (semua kategori) - Ilmu Komputer (Lain-Lain)
Articles 4 Documents
 1 
Search results for , issue "Vol 1, No 1 (2017): March 2017" : 4 Documents clear
Russel Approximation Method And Vogel’s Approximation Method In Solving Transport Problem Nelly Astuti Hasibuan
The IJICS (International Journal of Informatics and Computer Science) Vol 1, No 1 (2017): March 2017
Publisher : STMIK Budi Darma

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (370.186 KB) | DOI: 10.30865/ijics.v1i1.454

Abstract

Transportation problems can be regarded as one of the problems that occur routinely in a company in the process of distributing products from several sources to certain places. Transportation issues are included in one of the optimization issues in operations research aimed at minimizing transportation costs. Differences in transportation costs can be due to several factors such as distance gap, type of transport used and other things. The optimization of transportation cost can be done by using Vogel Approximation method and Russel Approximation Method. Method. To see the effectiveness of optimization conducted by the two methods is needed a comparison process.
Image Scrambling Using One Time Pad with Linear Congruent Key Generator Imam Saputra
The IJICS (International Journal of Informatics and Computer Science) Vol 1, No 1 (2017): March 2017
Publisher : STMIK Budi Darma

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (445.148 KB) | DOI: 10.30865/ijics.v1i1.525

Abstract

With the changing of the times, more and more moments can be photographed. Digital imagery stores a lot of information through visual display. Many people perpetuate the things that are personal in the form of digital imagery, with so many files in the form of digital imagery that is private and not for publication. With the development of cloud computing systems, every image recorded through the smartphone will be synchronized with the online storage service provider. This has many advantages, such as users do not have to worry about the damage to storage devices that exist in their gadgets. But the disadvantage of this system is that if an account falls into the hands of an unauthorized person then photographs containing this personal information may be published by an unauthorized person, of course this will be very detrimental. One solution that can be used is to randomize the original image so that its visual appearance will not be like the actual visual display. One way that can be used for image randomization is by cryptographic techniques. The one time pad algorithm is a very powerful classical cryptographic algorithm and can not be solved by cryptanalis until now. One disadvantage of a one time pad algorithm is the key length must be the same as the length of the plaintext. This makes the algorithm unused because it is less practical in its key usage. To overcome this required a key generator that could generate randomly generated locks ie a linear congruent generator, thus the key length must be equal to the length of the plaintext can be generated only with a few variables. In this way, image randomization can be done with a strong and practical cryptographic algorithm.
Sequitur Algorithm For Particular Character Compression Or Words Always Returned Efori Buulolo
The IJICS (International Journal of Informatics and Computer Science) Vol 1, No 1 (2017): March 2017
Publisher : STMIK Budi Darma

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (311.835 KB) | DOI: 10.30865/ijics.v1i1.344

Abstract

Character pairs or recurrent words are often found on large documents. The document uses a large space in storage. At this time the storage with a large amount of space is not a problem anymore, with the availability of various media types of large data storage media and the price is very affordable. Although in the form of storage media is not a problem but in the storage and transmission of data, a large document would need an efficient for storage space and so does the case of data transmission. The Sequitur algorithm is one suitable algorithm for concluding context-free grammar into a compression to reduce repetitive input. The Sequitur algorithm is perfect for large document compression with paired or repeated characters so that the document uses more efficient storage space in the case of data transmission
Application Of Boyer Moore Algorithm for Text Searching Fince Tinus Waruwu
The IJICS (International Journal of Informatics and Computer Science) Vol 1, No 1 (2017): March 2017
Publisher : STMIK Budi Darma

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (254.52 KB) | DOI: 10.30865/ijics.v1i1.385

Abstract

Technology at the moment is very rapid development in business, and education. Many developers or application makers are competing in improving science about the science of technology so as not to miss. Technology is an integral part of human life. Computer application is one part that is not separated from the computer. An application is a software that actually works to simplify the job. Thus, at this time already many computer applications are created. In the course, the application software always experienced improvements made by the manufacturer. These improvements lead to improved facilities to make it easier for users to work. In the world of education or the world of work a lot of work done by using computers such as typing by using text editor applications such as Microsoft Word in the manufacture of scientific work or other work, often mistakes in terms of writing words, often mistakes occur not because of intentional but because of community habits In abbreviating words when writing. It is necessary an application that can facilitate the examination of a writing in order to find the wrong word or abbreviated and automatically the application will fix it (text improvement). To make it easier to find the wrong word in the application, it needs string matching technique using Boyer Moore algorithm. The application is built with Microsoft Visual Studio 2008 and MySQL as the. 

Page 1 of 1 | Total Record : 4

 1 

Filter by Year

2017 2017


Reset
Filter By Issues
All Issue Vol. 9 No. 3 (2025): November Vol. 9 No. 2 (2025): July Vol 7, No 1 (2023): March 2023 Vol 6, No 3 (2022): November 2022 Vol 6, No 2 (2022): July 2022 Vol 6, No 1 (2022): March 2022 Vol 5, No 3 (2021): November 2021 Vol 5, No 2 (2021): July 2021 Vol 5, No 1 (2021): March 2021 Vol 4, No 2 (2020): September 2020 Vol 4, No 1 (2020): March 2020 Vol 3, No 2 (2019): September 2019 Vol 3, No 1 (2019): March 2019 Vol 1, No 2 (2017): September 2017 Vol 2, No 1 (2018): March 2018 Vol 1, No 1 (2017): March 2017 More Issue