cover
Contact Name
-
Contact Email
-
Phone
-
Journal Mail Official
-
Editorial Address
-
Location
Kota pematangsiantar,
Sumatera utara
INDONESIA
IJISTECH (International Journal Of Information System & Technology)
ISSN : 25807250     EISSN : -     DOI : -
Core Subject : Science,
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 21 Documents
Comparative Analysis of Pathfinding Algorithms A *, Dijkstra, and BFS on Maze Runner Game Handy Permana, Silvester Dian; Yogha Bintoro, Ketut Bayu; Arifitama, Budi; Syahputra, Ade
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 | 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.
Generating Mersenne Prime Number Using Rabin Miller Primality Probability Test to Get Big Prime Number in RSA Cryptography Apdilah, Dicky; Khairina, Nurul; Harahap, Muhammad Khoiruddin
IJISTECH (International Journal Of Information System & Technology) Vol 1, No 1 (2017): November
Publisher : Sekolah Tinggi Ilmu Komputer (STIKOM) Tunas Bangsa

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

Abstract

Cryptography RSA method (Rivest - Shamir - Adelman) require large-scale primes to obtain high security that is in greater than or equal to 512, in the process to getting the securities is done to generation or generate prime numbers greater than or equal to 512. Using the Sieve of Eratosthenes is needed to bring up a list of small prime numbers to use as a large prime numbers, the numbers from the result would be combined, so the prime numbers are more produced by the combination Eratosthenes. In this case the prime numbers that are in the range 1500 < prime <2000, for the next step the result of the generation it processed by using the Rabin - Miller Primarily Test. Cryptography RSA method (Rivest - Shamir - Adleman) with the large-scale prime numbers would got securities or data security is better because the difficulty to describe the RSA code gain if it has no RSA Key same with data sender.
Evacuation Planning for Disaster Management by Using The Relaxation Based Algorithm and Route Choice Model Hartama, Dedy; Windarto, Agus Perdana; Wanto, Anjar
IJISTECH (International Journal Of Information System & Technology) Vol 2, No 1 (2018): November
Publisher : Sekolah Tinggi Ilmu Komputer (STIKOM) Tunas Bangsa

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

Abstract

Research in the field of disaster management is done by utilizing information and communication technology. Where disaster management is discussed is about evacuation planning issues. The evacuation stage is a very crucial stage in the disaster evacuation process. There have been many methods and algorithms submitted for the evacuation planning process, but no one has directly addressed evacuation planning on dynamic issues concerning time-varying and volume-dependent. This research will use the Relaxation-Based Algorithm combined with the Route Choice Model to produce evacuation models that can be applied to dynamic issues related to time-varying and volume-dependent because some types of disaster will result in damage as time and evacuation paths are volume-dependent so as to adjust to the change in the number of people evacuated. Disaster data that will be used in this research is sourced from Disaster Information Management System sourced from DesInventar. The results of this study are expected to produce an evacuation planning model that can be applied to dynamic problems that take into account the time-varying and volume-dependent aspects.
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 | 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.
Implementation and Analysis Zhu-Takaoka Algorithm and Knuth-Morris-Pratt Algorithm for Dictionary of Computer Application Based on Android Handrizal, Handrizal; Budiman, Andri; Ardani, Desy Rahayu
IJISTECH (International Journal Of Information System & Technology) Vol 1, No 1 (2017): November
Publisher : Sekolah Tinggi Ilmu Komputer (STIKOM) Tunas Bangsa

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

Abstract

The string matching algorithm is the one of the most important parts in the various processes related to data and text types, which is the word search on computer dictionary. Computers have a basic role in the field of education, especially in teaching and learning activities. So that the classical learning model, that is by using the book as learning resource can be boring. To make it easier for users who searching words, we made an offline dictionary application based on Android by applying Zhu-Takaoka algorithm and Knuth-Morris-Pratt algorithm. The performance of Zhu-Takaoka is doing a search starts from the end of pattern that is tailored to the text, but in Knuth-Morris-Pratt algorithm starts from the beginning of pattern till match which the pattern used is word searched. The result of this research indicates that the Zhu-Takaoka algorithm is faster than the Knuth-Morris-Pratt algorithm which showed the running time of each algorithm.
The Online Marketing Strategic Planning for Jember Coffee SMEs Juwita, Oktalia; Arifin, Fajrin Nurman; Dewi, Fitriyana
IJISTECH (International Journal Of Information System & Technology) Vol 2, No 1 (2018): November
Publisher : Sekolah Tinggi Ilmu Komputer (STIKOM) Tunas Bangsa

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

Abstract

Coffee is a kind of beverage that is widespread and much-loved in the world. Today coffee has become a lifestyle. Various kinds of coffee are offering in many shops. This is a great opportunity for entrepreneurs, especially SMEs providers of coffee products, in introducing and marketing variants of coffee products that are owned at the national and international level. One of the problems often arises in the marketing of SMEs products is the lack of information and marketing access to potential markets. An effective and appropriate marketing strategy is needed, especially for SMEs producing coffee products. The research method is done by observation and interview to get primary and secondary data. After the data obtained, analyzed the current condition using SWOT analysis and then followed by strategy mapping using SOSTAC method. From the analysis that has been done, needed a website for the directory to introduce SMEs engaged in the production and sale of coffee in Besuki Raya area.
Message Security on Chat App based on Massey Omura Algorithm Zebua, Taronisokhi; Hondro, Rivalri Kristianto; Ndruru, Eferoni
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 | 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
Neural Network Analysis With Backpropogation In Predicting Human Development Index (HDI) Component by Regency/City In North Sumatera Siregar, Muhammad Noor Hasan
IJISTECH (International Journal Of Information System & Technology) Vol 1, No 1 (2017): November
Publisher : Sekolah Tinggi Ilmu Komputer (STIKOM) Tunas Bangsa

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

Abstract

Human Development Index (HDI) measures human development outcomes based on a number of basic components of quality of life. As a measure of the quality of life, HDI is built through a basic three-dimensional approach. Data obtained from the Central Bureau of Statistics 2015 for Human Development Index (HDI) by Regency / City in North Sumatera Province consisting of 32 alternatives and with 4 parameters ie life expectancy (year), expectation, school length (%), the average length of school (year) and per capita real expenditure (Rp). By using backpropagation obtained result of 6 testing of architecture pattern that is: 4-5-1, 4-10-1, 4-5-10-1, 4-10-5-1, 4-10-20-1 and 4- 15-20-1 obtained best architectural pattern is 4-10-20-1 with epoch 2126, error 0.0011757393, execution time 00:16 and accuracy 100%.
Effectiveness of Population Data Application Implementation in Kresek Village, Wungu Sub-District, Madiun Regency Putera, Andi Rahman; Resty, Eka; S, Benny Agus; Prihantono, Ilham
IJISTECH (International Journal Of Information System & Technology) Vol 2, No 1 (2018): November
Publisher : Sekolah Tinggi Ilmu Komputer (STIKOM) Tunas Bangsa

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

Abstract

Population data processing conducted in Kresek Village, Wungu Sub-District, Madiun District is still manual. Data processing that has been used so far is the Excel application. This, causing data processing requires not a little time and quite a long time. With a system that has long data storage is not safe, especially in the long term. To overcome the problems related to population data, it is designed an application to process the data more easily and safely. The purpose of this study was to determine the effectiveness of the previously designed application of population data in Kresek Village. The study was conducted in Kresek Village, Wungu Sub-District, Madiun Regency. Respondents of this study were 2 Kresek Village officers as users. The analytical method used is descriptive analysis using data from interviews with respondents. Evaluation analysis is carried out to explain the new system that has been implemented. Based on the results of the study, it can be concluded that the application that has been designed is in accordance with the wishes of the Kresek village office. This application is able to ease the workload of village officials so that population data processing is more effective and efficient.
Cloud Computing Implementation with Docker Engine Swarm Mode for Data Availability Infrastructure of Rice Plants Juwita, Oktalia; Firmansyah, Diksy Media
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 | 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.

Page 1 of 3 | Total Record : 21