cover
Contact Name
Hapnes Toba
Contact Email
hapnestoba@it.maranatha.edu
Phone
+6222-2012186
Journal Mail Official
hapnestoba@it.maranatha.edu
Editorial Address
Fakultas Teknologi dan Rekayasa Cerdas Universitas Kristen Maranatha Jl. Prof. Drg. Suria Sumantri No. 65 Bandung
Location
Kota bandung,
Jawa barat
INDONESIA
JuTISI (Jurnal Teknik Informatika dan Sistem Informasi)
ISSN : 24432210     EISSN : 24432229     DOI : https://doi.org/10.28932/jutisi
Core Subject : Science,
Paper topics that can be included in JuTISI are as follows, but are not limited to: • Artificial Intelligence • Business Intelligence • Cloud & Grid Computing • Computer Networking & Security • Data Analytics • Datawarehouse & Datamining • Decision Support System • E-Systems (E-Gov, E-Health, E-Commerce, etc.) • Enterprise System (SCM, ERP, CRM) • Human-Computer Interaction • Image Processing • Information Retrieval • Information System • Information System Audit • Enterprise Architecture • Knowledge Management • Machine Learning • Mobile Computing & Application • Multimedia System • Open Source System & Technology • Semantic Web & Web 2.0
Articles 15 Documents
Search results for , issue "Vol 1 No 2 (2015): JuTISI" : 15 Documents clear
Aplikasi Optimalisasi Muat Barang Dengan Penerapan Algoritma Dynamic Programming Pada Persoalan Integer Knapsack Daniel Jahja Surjawan; Irene Susanto
Jurnal Teknik Informatika dan Sistem Informasi Vol 1 No 2 (2015): JuTISI
Publisher : Maranatha University Press

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.28932/jutisi.v1i2.582

Abstract

In the era of globalization, the use of information technology become a necessity that can not be separated in running a business in all instances. The need of information technology is not only used as a supporter of the process, but also has become a major part of which should go well. It was felt also by the CV. Labatrans engaged in courier services, which often occurs excess or shortage even when the goods are loaded into a vehicle that will deliver. There has been no control of the goods to be delivered, so that sometimes exceed the limit load capacity of the vehicle. This cause a heap of goods in the warehouse, and the main problem consumers will be disappointed because the goods delivered are not accepted at the right promised time. Another problem occurs when consumers asked where the goods they are shipped, they want to know where their goods for some reason such as perishable goods or food. And usually the staff of the company can not give an answer because of limited information. The purpose of this research is to create an application that can handle tracking of goods delivered and the load optimization by applying Dynamic Programming Algorithms on the issue of Integer Knapsack
Analisa Nilai Lamda Model Jarak Minkowsky Untuk Penentuan Jurusan SMA (Studi Kasus di SMA Negeri 2 Tualang) Khairul Umam Syaliman bin Lukman; Ause Labellapansa
Jurnal Teknik Informatika dan Sistem Informasi Vol 1 No 2 (2015): JuTISI
Publisher : Maranatha University Press

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.28932/jutisi.v1i2.583

Abstract

SMA Negeri 2 (SMAN 2) is located in Tualang. So far the data report student majors only stored in a database as a final report. Data from the report of the majors could be used as guidelines to determine the students' decision majors for the following year. To take advantage of the data stored in that particular database, we can use data mining disciplines. The method used to make the determination of students majoring done by using Nearest K-Nearest Neighbor (K-NN) algorithm. On the other hand, the method for calculating the distance between the data used models Minkowsky distance with a value of lambda (λ) as a parameter. Lambda values that were analyzed were lambda 1, 2 and 3. Lambda with the value of 1 can generate increasing accuracy in the 11th experiment or with a large amount of data equal to 276 data. Lambda 2 will produce increasing accuracy by the 16th experiment or with the number of training data equal to 356 data while lambda 3 can also produce accuracy continuously increasing by the 11th experiement or with the amount of training data equal to 276 data. The accuracy of the lambda value of 1 is better than lambda 2 and lambda 3. This was proven in 25 experiments at lambda 1 which produces the highest accuracy value for 20 times.Keywords — Classification, Data Mining, K-Nearest Neighbor, Lamda (λ), Minkowsky.
Sistem Pendeteksi Pengirim Tweet dengan Metode Klasifikasi Naive Bayes Maresha Caroline Wijanto
Jurnal Teknik Informatika dan Sistem Informasi Vol 1 No 2 (2015): JuTISI
Publisher : Maranatha University Press

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.28932/jutisi.v1i2.584

Abstract

Until Januari 2015, social media users reached 29% of the world population. In Indonesia itself had 28% active users from total populasi of Indonesia. The usage of social media gives positives and negatives effect. The negatives effect are the increasing number of fraud by using SMS or social media, such as Twitter. Many people are deceived by the tweet messages sent from known user account when in fact the sender is other person. Because of that, there is a need to have a system to detect wheteher the tweet sender is the same person or not. Naive Bayes classifiers method is used to classify that. The data source is taken from tokens selected based on two models, the minimum n-time number of occurrences and the n-th highest number of occurrences. Each tweets also processed into six different types of tweets, such as formal tweet or lowercase tweet. The test uses tenfold cross-validation and measured by the value of accuracy, precision, recall, and F-score. The common result shows 82,145% level of accuracy. Second model to select the tokens shows consistency level of accuracy for each types of tweets. The fifth types of tweets also get the highest level of accuracy for both models to select the tokens.
Implementasi dan Pengukuran Kinerja Operasi Aritmatika Finite Field Berbasis Polinomial Biner Wenny Franciska Senjaya; Budi Rahardjo
Jurnal Teknik Informatika dan Sistem Informasi Vol 1 No 2 (2015): JuTISI
Publisher : Maranatha University Press

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.28932/jutisi.v1i2.585

Abstract

Cryptography is one of the security techniques that secure information confidentiality and information integrity while electronic transaction processing. There are three kinds of cryptograpy protocols, Symmetric Algorithms, Asymmetric (Public Key) Algorithms, and Cryptographic Protocols. Elliptic Curve Cryptography (ECC) is one of the public key encryption. ECC requires high computation for solving arithmetic operations.Finite field has important role in ECC implementation, which curve operations requires finite field. Finite field has several arithmetic operations, add, multiplication, squaring, and invers. There are many method or algorithm for each arithmetic operation. Finite field can be representation in prime field GF(p) and binary field GF(2m). There are two representation in binary field, polynomial basis and normal basis. This research presents implementation of arithmetic operation algorithms for adding, multiplication, squaring, and invers on polynomial basis with maximum key 299 bits. Besides that, this research presents the measurement of algorithm performance based on processing time and memory usage. Keywords — cryptography, elliptic curve, finite field, polynomial basis, binary field
Halaman Belakang JuTISI edisi Agustus 2015 Redaksi JuTISI
Jurnal Teknik Informatika dan Sistem Informasi Vol 1 No 2 (2015): JuTISI
Publisher : Maranatha University Press

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.28932/jutisi.v1i2.586

Abstract

Ini adalah halaman belakang dari JuTISI edisi Agustus 2015

Page 2 of 2 | Total Record : 15