cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
-
Contact Email
-
Phone
-
Journal Mail Official
-
Editorial Address
-
Location
Kota pematangsiantar,
Sumatera utara
INDONESIA
IJISTECH (International Journal Of Information System & Technology)
Published by STIKOM Tunas Pematang Siantar
ISSN : 25807250     EISSN : -     DOI : -
Core Subject : Science,
Computer Science & IT
IJISTECH (International Journal Of Information System & Technology) is published with both online and print versions. The journal covers the frontier issues in the computer science and their applications in business, industry and other subjects. The computer science is a branch of engineering science that studies computable processes and structures. It contains theories for understanding computing systems and methods; computational algorithms and tools; methodologies for testing of concepts. The subjects covered by the journal include artificial intelligence, bioinformatics, computational statistics, database, data mining, financial engineering, hardware systems, imaging engineering, internet computing, networking, scientific computing, software engineering, and their applications etc.
Arjuna Subject : -
Articles 5 Documents
 1 
Search results for , issue "Vol 1, No 2 (2018): May" : 5 Documents clear
Comparative Analysis of Pathfinding Algorithms A *, Dijkstra, and BFS on Maze Runner Game Silvester Dian Handy Permana; Ketut Bayu Yogha Bintoro; Budi Arifitama; Ade Syahputra
IJISTECH (International Journal of Information System and Technology) Vol 1, No 2 (2018): May
Publisher : Sekolah Tinggi Ilmu Komputer (STIKOM) Tunas Bangsa

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (205.803 KB) | DOI: 10.30645/ijistech.v1i2.7

Abstract

Maze Runner game is a game that requires pathfinding algorithm to get to the destination with the shortest path. This algorithm is used in an NPC that will move from start node to destination node. However, the use of incorrect algorithms can affect the length of the computing process to find the shortest path. The longer the computing process, the longer the players have to wait. This study compared pathfinding algorithms A *, Dijkstra, and Breadth First Search (BFS) in the Maze Runner game. Comparison process of these algorithms was conducted by replacing the algorithm in the game by measuring the process time, the length of the path, and the numbers of block played in the existing computing process. The results of this study recommend which algorithm is suitable to be applied in Maze Runner Game.
Design Warehouse Management Inventory System Based On The Website Aria, Ririn Restu; Rahadjeng, Indra Riyana
IJISTECH (International Journal of Information System & Technology) Vol 1, No 2 (2018): May
Publisher : Sekolah Tinggi Ilmu Komputer (STIKOM) Tunas Bangsa

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (260.247 KB) | DOI: 10.30645/ijistech.v1i2.8

Abstract

Warehouse management system is one of the most important parts of manufacturing companies in order to monitor all the supplies owned by the company for incoming goods and goods out. PT. Arista Latindo, is still using manual way to know the inventory they have today, so it will take a lot of time to be able to process the results of the use of raw materials, the resulting production, when using the system there are many mistakes that often occur in the process of recording thus affecting the overall system. Therefore, with technological advances to improve the existing system from the manual will be converted into computerized. For making these applications can use the website as a form of view that can be accessed by administrators more easily, quickly and effectively. When the design is done to better understand the needs of the user, the process is done and the output to be used, the testing process is done by waterfall method and black box testing method to check the errors associated with the display in applications that have been made and will be used in the company.
Message Security on Chat App based on Massey Omura Algorithm Taronisokhi Zebua; Rivalri Kristianto Hondro; Eferoni Ndruru
IJISTECH (International Journal of Information System and Technology) Vol 1, No 2 (2018): May
Publisher : Sekolah Tinggi Ilmu Komputer (STIKOM) Tunas Bangsa

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (189.109 KB) | DOI: 10.30645/ijistech.v1i2.11

Abstract

Security of message on chat apps is very important to do so that messages that distributed always safety for others who do not have access permission. However, not all chat apps currently have tools that used to secure messages. This is still often overlooked, thus providing an easy space for the attackers to hack messages that are distributed. This research explains the usage of the massey-omura algorithm to secure text type message in chat apps when message distributed
Cloud Computing Implementation with Docker Engine Swarm Mode for Data Availability Infrastructure of Rice Plants Oktalia Juwita; Diksy Media Firmansyah
IJISTECH (International Journal of Information System and Technology) Vol 1, No 2 (2018): May
Publisher : Sekolah Tinggi Ilmu Komputer (STIKOM) Tunas Bangsa

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30645/ijistech.v1i2.10

Abstract

Data of rice plant is important in Indonesia because rice is the staple food for Indonesian people. Rice plant data can be formatted into web service, so anyone can access the information from anywhere by using internet. But, high numbers of request are the problem for web server apps. One of the solution is by distributing request into some server. In this paper, we will compare failed request and time per request in conventional server and clustered server with docker swarm. Server apps in clustered server shows lower value of failed request than conventional server in our experiment. With two containers, number of failed request obtain 0.78% lower than conventional server in 25.000 requests, and 0.69% lower than conventional server in 50.000 requests.
ANN: Model of Back-Propagation Architecture on the Logs Production by Type of Wood Muhammad Noor Hasan Siregar
IJISTECH (International Journal of Information System and Technology) Vol 1, No 2 (2018): May
Publisher : Sekolah Tinggi Ilmu Komputer (STIKOM) Tunas Bangsa

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (545.23 KB) | DOI: 10.30645/ijistech.v1i2.12

Abstract

Indonesia is rich in forest products. The production forest is a forest area that can be utilized for the community, such as logs, rattan, and some forest plants that have high economic value. This research aims to make the best architectural model by using artificial neural network. The method used is backpropagation algorithm. With this model it will continue to predict the output of logs. Data are sourced from BPS-Statistics Indonesia. Based on the results of research results of logs production using backpropogation method, obtained the result of 3 model architecture (18-18-1, 18-25-1 and 18-18-25- 1) that model of architecture 18- 25-1 is the best model with 72% accuracy, MSE: 0.0221670942 and epochs: 660.

Page 1 of 1 | Total Record : 5

 1 

Filter by Year

2018 2018


Reset
Filter By Issues
All Issue Vol 9, No 1 (2025): The June Edition Vol 8, No 6 (2025): The April edition Vol 8, No 5 (2025): The February edition Vol 8, No 4 (2024): The December edition Vol 8, No 3 (2024): The October edition Vol 8, No 2 (2024): The August edition Vol 8, No 1 (2024): The June edition Vol 7, No 6 (2024): The April edition Vol 7, No 5 (2024): The February edition Vol 7, No 4 (2023): The December edition Vol 7, No 3 (2023): The October edition Vol 7, No 2 (2023): The August edition Vol 7, No 1 (2023): The June edition Vol 6, No 6 (2023): April Vol 6, No 5 (2023): February Vol 6, No 4 (2022): Decembar Vol 6, No 3 (2022): October Vol 6, No 2 (2022): August Vol 6, No 1 (2022): June Vol 5, No 6 (2022): April Vol 5, No 5 (2022): February Vol 5, No 4 (2021): December Vol 5, No 3 (2021): October Vol 5, No 2 (2021): August Vol 5, No 1 (2021): June Vol 4, No 2 (2021): May Vol 4, No 1 (2020): November Vol 3, No 2 (2020): May Vol 3, No 1 (2019): November Vol 2, No 2 (2019): May Vol 2, No 1 (2018): November Vol 1, No 2 (2018): May Vol 1, No 1 (2017): November More Issue