cover
Contact Name
-
Contact Email
-
Phone
-
Journal Mail Official
-
Editorial Address
-
Location
Kota malang,
Jawa timur
INDONESIA
Journal of Information Technology and Computer Science
Published by Universitas Brawijaya
ISSN : 25409433     EISSN : 25409824     DOI : -
The Journal of Information Technology and Computer Science (JITeCS) is a peer-reviewed open access journal published by Faculty of Computer Science, Universitas Brawijaya (UB), Indonesia. The journal is an archival journal serving the scientist and engineer involved in all aspects of information technology, computer science, computer engineering, information systems, software engineering and education of information technology. JITeCS publishes original research findings and high quality scientific articles that present cutting-edge approaches including methods, techniques, tools, implementations and applications.
Arjuna Subject : -
Articles 99 Documents
Selection and Recommendation Scholarships Using AHP-SVM-TOPSIS Putra, M Gilvy Langgawan; Ariyanti, Whenty; Cholissodin, Imam
Journal of Information Technology and Computer Science Vol 1, No 1: June 2016
Publisher : Faculty of Computer Science (FILKOM) Brawijaya University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (938.182 KB) | DOI: 10.25126/jitecs.2016111

Abstract

Abstract. Gerakan Nasional Orang Tua Asuh Scholarship offers a number of scholarship packages. As there are a number of applicants, a system for selection and recommendation is required. we used 3 methods to solve the problem, the methods are AHP for feature selection, SVM for classification from 3 classes to 2 classes, and then TOPSIS give a rank recommendation who is entitled to receive a scholarship from 2 classes. In testing threshold for AHP method the best accuracy 0.01, AHP selected 33 from 50 subcriteria. SVM has highest accuracy in this research is 89.94% with Sequential Training parameter are λ =0.5, constant of γ =0.01 , ε = 0.0001, and C = 1. Keywords: Selection, Recommendation, Scholarships, AHP-SVM-TOPSIS
Framework Design for Modular Web-based Application Using Model-CollectionService-Controller-Presenter (MCCP) Pattern Pinandito, Aryo; Permana, Ferdika Bagus Pristiawan; Perdana, Rizal Setya
Journal of Information Technology and Computer Science Vol 2, No 1: June 2017
Publisher : Faculty of Computer Science (FILKOM) Brawijaya University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1188.423 KB) | DOI: 10.25126/jitecs.20172120

Abstract

Information system is one of the most important business supports in organizations. Web-based applications become an appropriate solution to overcome the dynamically changing environment among different units in an organization. Model-View-Controller (MVC) is a well-known design pattern in web-based application development due to the separation of an application into several parts, hence it is easy to reuse and maintain. However, such design pattern requires improvements since the information system handles business process choreography and integration between application. Therefore, modifying the interaction of object of class in a design pattern become a challenging problem. In this paper, an application framework based on Model-CollectionService-Controller-Presenter (MCCP) design pattern, which is a modification of an MVC, was proposed. The proposed framework allows multiple different applications to run and provides inter-application data exchange mechanisms to improve the data communication process between applications. Several performance comparisons with another popular web application framework are also presented.
Cost Optimization of Multi-Level Multi-Product Distribution Using An Adaptive Genetic Algorithm Sarwani, Mohammad Zoqi; Mahmudy, Wayan Firdaus; Naba, Agus
Journal of Information Technology and Computer Science Vol 1, No 2: November 2016
Publisher : Faculty of Computer Science (FILKOM) Brawijaya University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (561.249 KB) | DOI: 10.25126/jitecs.20161218

Abstract

Distribution is the challenging and interesting problem to be solved. Distribution problems have many facets to be resolved because it is too complex problems such as limited multi-level with one product, one-level and multi-product even desirable in terms of cost also has several different versions. In this study is proposed using an adaptive genetic algorithm that proved able to acquire efficient and promising result than the classical genetic algorithm. As the study and the extension of the previous study, this study applies adaptive genetic algorithm considering the problems of multi-level distribution and combination of various products. This study considers also the fixed cost and variable cost for each product for each level distributor. By using the adaptive genetic algorithm, the complexity of multi-level and multi-product distribution problems can be solved. Based on the cost, the adaptive genetic algorithm produces the lowest and surprising result compared to the existing algorithm
Belief Value Development In Dempster-Shafer With Particle Swarm Optimization(PSO) For Determining Of The Provision On Cases Of Persecution Nababan, Merry Gricelya; Anggodo, Yusuf Priyo; Putri, Rekyan Regasari Mardi
Journal of Information Technology and Computer Science Vol 2, No 2: November 2017
Publisher : Faculty of Computer Science (FILKOM) Brawijaya University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (31.232 KB) | DOI: 10.25126/jitecs.20172231

Abstract

The problem of uncertainty often becomes an obstacle, especially in terms of diagnosing the provision in this study. There is an algorithm that can solve this problem is Dempster-shafer (D-S), this algorithm has belief value that serves to determine the influence between symptoms. Belief value is obtained from experts, when there are new symptoms must have to ask the experts to know the value of belief, and takes time as well. So the Particle Swarm Optimization (PSO) algorithm will help generate and optimize the value of belief in D-S. PSO is able to produce optimal belief value. This research is to generate value belief D-S with PSO.
Design of Speaker Verification using Dynamic Time Warping (DTW) on Graphical Programming for Authentication Process Prasetio, Barlian Henryranu; Syauqy, Dahnial
Journal of Information Technology and Computer Science Vol 2, No 1: June 2017
Publisher : Faculty of Computer Science (FILKOM) Brawijaya University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (494.709 KB) | DOI: 10.25126/jitecs.20172124

Abstract

Authentication is generally required on systems which need safety and privacy. In common, typed username and password are used and applied in authentication system. However, this type of authentication has been identified to have many weaknesses. In order to overcome the problem, many proposed authentication system based on voice as unique characteristics of human. We implement Dynamic Time Warping algorithm to compare human voice with reference voice as the authentication process. The testing results show that the system accuracy of the speech recognition average is 86.785%.
Review: A State-of-the-Art of Time Complexity (Non-Recursive and Recursive Fibonacci Algorithm) Cholissodin, Imam; Riyandani, Efi
Journal of Information Technology and Computer Science Vol 1, No 1: June 2016
Publisher : Faculty of Computer Science (FILKOM) Brawijaya University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1010.148 KB) | DOI: 10.25126/jitecs.2016112

Abstract

Abstract. Solving strategies in the computation the time complexity of an algorithm is very essentials. Some existing methods have inoptimal in the explanations of solutions, because it takes a long step and for the final result is not exact, or only limited utilize in solving by the approach. Actually there have been several studies that develop the final model equation Fibonacci time complexity of recursive algorithms, but the steps are still needed a complex operation. In this research has been done several major studies related to recursive algorithms Fibonacci analysis, which involves the general formula series, begin with determining the next term directly with the equation and find the sum of series also with an equation too. The method used in this study utilizing decomposition technique with backward substitution based on a single side outlining. The final results show of the single side outlining was found that this technique is able to produce exact solutions, efficient, easy to operate and more understand steps. Keywords: Time Complexity, Non-Recursive, Recursive, Fibonacci Algorithm
Rainfall Forecasting Using Backpropagation Neural Network Sihananto, Andreas Nugroho; Mahmudy, Wayan Firdaus
Journal of Information Technology and Computer Science Vol 2, No 2: November 2017
Publisher : Faculty of Computer Science (FILKOM) Brawijaya University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (390.659 KB) | DOI: 10.25126/jitecs.2017229

Abstract

Rainfall already became vital observation object because it affects society life both in rural areas or urban areas. Because parameters to predict rainfall rates is very complex, using physics based model that need many parameters is not a good choice. Using alternative approach like time-series based model is a good alternative. One of the algorithm that widely used to predict future events is Neural Network Backpropagation. On this research we will use Nguyen-Widrow method to initialize weight of Neural Network to reduce training time. The lowest MSE achieved is {0,02815;  0,01686; 0,01934; 0,03196} by using 50 maximum epoch and 3 neurons on hidden layer.
Rainfall Forecasting in Banyuwangi Using Adaptive Neuro Fuzzy Inference System Alfarisy, Gusti Ahmad Fanshuri; Mahmudy, Wayan Firdaus
Journal of Information Technology and Computer Science Vol 1, No 2: November 2016
Publisher : Faculty of Computer Science (FILKOM) Brawijaya University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (590.164 KB) | DOI: 10.25126/jitecs.20161212

Abstract

Rainfall forcasting is a non-linear forecasting process that varies according to area and strongly influenced by climate change. It is a difficult process due to complexity of rainfall trend in the previous event and the popularity of Adaptive Neuro Fuzzy Inference System (ANFIS) with hybrid learning method give high prediction for rainfall as a forecasting model. Thus, in this study we investigate the efficient membership function of ANFIS for predicting rainfall in Banyuwangi, Indonesia. The number of different membership functions that use hybrid learning method is compared. The validation process shows that 3 or 4 membership function gives minimum RMSE results that use temperature, wind speed and relative humidity as parameters.
Scheduling Optimization For Extract, Transform, Load (ETL) Process On Data Warehouse Using Round Robin Method (Case Study: University Of XYZ) Berliantara, Agung Yudha; Wicaksono, Satrio Agung; Pinandito, Aryo
Journal of Information Technology and Computer Science Vol 2, No 2: November 2017
Publisher : Faculty of Computer Science (FILKOM) Brawijaya University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (445.001 KB) | DOI: 10.25126/jitecs.20172232

Abstract

ETL scheduling is a challenging and exciting issue to solve. The ETL scheduling problem has many facets, one of which is the cost of time. If it is not handled correctly, it may take a very long time to execute and inconsistent data in very large data. In this study using Round-robin algorithm method that proved able to produce efficient results and in accordance with conventional methods. After doing the research, the difference between these two methods is about execution time. Through this experiment, the Round-robin scheduling method gives a more efficient execution time of up to 61% depending on the amount of data and the number of partitions used.
Implementation of Genetic Algorithm to Solve Travelling Salesman Problem with Time Window (TSP-TW) for Scheduling Tourist Destinations in Malang City Yuliastuti, Gusti Eka; Mahmudy, Wayan Firdaus; Rizki, Agung Mustika
Journal of Information Technology and Computer Science Vol 2, No 1: June 2017
Publisher : Faculty of Computer Science (FILKOM) Brawijaya University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (617.611 KB) | DOI: 10.25126/jitecs.20172122

Abstract

In doing travel to some destinantions, tourist certainly want to be able to visit many destinations with the optimal scheduling so that necessary in finding the best route and not wasting lots of time travel. Several studies have addressed the problem but does not consider other factor which is very important that is the operating hours of each destination or hereinafter referred as the time window. Genetic algorithm proved able to resolve this travelling salesman problem with time window constraints. Based on test results obtained solutions with the fitness value of 0,9856 at the time of generation of 800 and the other test result obtained solution with the fitness value of 0,9621 at the time of the combination CR=0,7 MR=0,3.

Page 1 of 10 | Total Record : 99