cover
Contact Name
Ni Made Satvika Iswari
Contact Email
satvika@umn.ac.id
Phone
-
Journal Mail Official
ultimatics@umn.ac.id
Editorial Address
-
Location
Kota tangerang,
Banten
INDONESIA
Jurnal ULTIMATICS
ISSN : 20854552     EISSN : 2581186X     DOI : -
Jurnal ULTIMATICS merupakan Jurnal Program Studi Teknik Informatika Universitas Multimedia Nusantara yang menyajikan artikel-artikel penelitian ilmiah dalam bidang analisis dan desain sistem, programming, algoritma, rekayasa perangkat lunak, serta isu-isu teoritis dan praktis yang terkini, mencakup komputasi, kecerdasan buatan, pemrograman sistem mobile, serta topik lainnya di bidang Teknik Informatika. Jurnal ULTIMATICS terbit secara berkala dua kali dalam setahun (Juni dan Desember) dan dikelola oleh Program Studi Teknik Informatika Universitas Multimedia Nusantara bekerjasama dengan UMN Press.
Arjuna Subject : -
Articles 275 Documents
Enhancing Decision Tree Performance in Credit Risk Classification and Prediction Raymond Sunardi Oetama
Ultimatics : Jurnal Teknik Informatika Vol 7 No 1 (2015): Ultimatics: Jurnal Ilmu Teknik Informatika
Publisher : Faculty of Engineering and Informatics, Universitas Multimedia Nusantara

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (455.735 KB) | DOI: 10.31937/ti.v7i1.349

Abstract

This study is focused on enhancing Decision Tree on its capabilities in classification as well as prediction. The capability of decision tree algorithm in classification outperforms its capability in prediction. The classification quality will be enhanced when it works with resampling techniques such as Adaboost.
Load Balancing pada Cloud Computing dengan Sumber Daya Terbatas Menggunakan Penggabungan Algoritma ESCE dan Throttled Endang Wahyu Pamungkas; Divi Galih Prasetyo Putri
Ultimatics : Jurnal Teknik Informatika Vol 7 No 1 (2015): Ultimatics: Jurnal Ilmu Teknik Informatika
Publisher : Faculty of Engineering and Informatics, Universitas Multimedia Nusantara

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1035.947 KB) | DOI: 10.31937/ti.v7i1.351

Abstract

Recently cloud computing technology has been implemented by many companies. This technology requires a really high reliability that closely related to hardware specification and management resource quality used. Adequate hardware would make resource allocation easier. On the other hand, resource allocation will be harder if the resources are limited. This is a common condition in a developing cloud service provider. In this paper, a load balancing algorithm to allocate resources in cloud computing environment that has limited resources has been proposed. This algorithm is developed by taking the advantages of the existing algorithms, Equally Spread Current Execution and Throttled. We merge those algorithm without losing the advantages and we try to eliminate the shortcoming of each algorithm. The result shows that this algorithm is able to give a significant improvement in the limited resources environment. In addition, the algorithm also able to compete with the other algorithm in the more adequate resource environment. Based on the consistent results, this algorithm is expected to be more adaptive in different resources environment.
Review Perangkat Lunak StarUML Berdasarkan Faktor Kualitas McCall Ni Made Satvika Iswari
Ultimatics : Jurnal Teknik Informatika Vol 7 No 1 (2015): Ultimatics: Jurnal Ilmu Teknik Informatika
Publisher : Faculty of Engineering and Informatics, Universitas Multimedia Nusantara

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1181.631 KB) | DOI: 10.31937/ti.v7i1.352

Abstract

Pembangunan perangkat lunak dilakukan berdasarkan hasil analisis kebutuhan fungsional yang diperlukan. Seringkali, perangkat lunak yang dikembangkan hanya cukup memenuhi kebutuhan fungsional dasar saja, padahal hal tersebut belum cukup untuk menjadikan perangkat lunak yang dibangun memiliki kinerja yang baik ketika dioperasikan. Terdapat beberapa faktor kualitas yang perlu diperhatikan yang akan menentukan kinerja perangkat lunak yang dibangun. Pada tulisan ini, akan diuraikan hasil analisis faktor kualitas terhadap kakas pemodelan perangkat lunak yang banyak digunakan, yaitu StarUML.
Implementasi Algoritma Genetika Pada Penempatan Tugas Asisten Laboratorium Berbasis Web Adhi Kusnadi; David Setyadi Santoso
Ultimatics : Jurnal Teknik Informatika Vol 7 No 2 (2015): Ultimatics: Jurnal Ilmu Teknik Informatika
Publisher : Faculty of Engineering and Informatics, Universitas Multimedia Nusantara

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1487.566 KB) | DOI: 10.31937/ti.v7i2.353

Abstract

On education system in University, the given subject is not only theoretics subject, but practicum also. In teaching practical subjects, the lecturer often experiences a difficulty to answer and handle every question that the students have in laboratory. Therefore, the assistant laboratory is needed here. One of the division in Universitas Multimedia Nusantara, ICT LAB still arranges the assignment of the assistant laboratory manually. It is difficult and takes some times. This thing becomes the reason for the development of an application ICT LAB that can do the assignment process automatically. This research is using Genetic algorithm that can calculate fitness value which show the matching level of the assignment that has been created. Based on the testing, using one point crossover, mutation on bit level, and rank selection, the average fitness value is 68.571% from all of the laboratory assistant vacancy. Based on the data used, there are 22 assignment slots on certain subjects that don’t have any applicant. So if that 22 slots are not used in the fitness calculation, there are only 118 assignment slot and the fitness value becomes 80,5%. This fitness value has problem with the quantity of student that didn’t fit to all of the assignment slot. Index Terms - Genetic Algorithm, rank selection, one point crossover, assignment, laboratory assistant.
Implementasi Simple Moving Average dan Exponential Moving Average dalam Menentukan Tren Harga Saham Perusahaan David Widodo; Seng Hansun
Ultimatics : Jurnal Teknik Informatika Vol 7 No 2 (2015): Ultimatics: Jurnal Ilmu Teknik Informatika
Publisher : Faculty of Engineering and Informatics, Universitas Multimedia Nusantara

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (2201.102 KB) | DOI: 10.31937/ti.v7i2.354

Abstract

The rapid economic growth, technology and science have a big impact on human mind for searching and getting money, one of the example is stocks investment. The information is so easy to find and disseminated, as well as the awareness and knowledge are the other key to be able to know and understand how to be a good investor. The purpose of this research was to implement simple moving average and exponential moving average to determine the trend of the stock price of a company. The application is by calculating the value of a simple moving average and exponential moving average period of 5 (weekly) and a period of 20 (monthly) then analyze the results of calculation with the data on the fact whether it is appropriate or not. The tests for this research is conducted using data from the 15 companies listed in the Indonesia Stock Exchange (IDX) and always included in the list of LQ45 index from 2005 to 2014. From the research that began on January 6, 2014 until September 29, 2015 for the simple moving average and the exponential moving average period of 5 (weekly) can be inferred that the level of accuracy of the simple moving average 5-day period was at 61,73%, then to the result of the exponential moving average 5-day period was at 68,07%. Then, based on research results that starting on January 1, 2014 until September 29, 2015 for the simple moving average and the exponential moving average 20day period (monthly) can be inferred that the level of accuracy of the simple moving average 20-day period was at 72,52%, and then to result 20-day period exponential moving average is at 73,39%.
Implementasi Zero Knowledge Proof Menggunakan Protokol Feige Fiat Shamir Untuk Verifikasi Tiket Rahasia Willy Sudiarto Raharjo; Dessy Sutanti
Ultimatics : Jurnal Teknik Informatika Vol 7 No 2 (2015): Ultimatics: Jurnal Ilmu Teknik Informatika
Publisher : Faculty of Engineering and Informatics, Universitas Multimedia Nusantara

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1094.174 KB) | DOI: 10.31937/ti.v7i2.355

Abstract

Cryptography is known for it’s ability to protect confidential information, but it can also be used for other purposes. One of them is for identity verification or authentication. One of the biggest disadvantages of traditional authencation method is at the end of the session, the verifier knows about secrets which is supposed to be known only by prover. In this paper, we implemented a ZeroKnowledge Proof-based secret ticket verification system using Feige Fiat Shamir protocol. The goal of this system is to help prover identified themselves to the verifier, but also prevent the verifier to understand anything about the prover’s secret information. The system is also able to prevent ticket duplication or double-use of tickets by using an interactive proof verification method. By combining it with cryptography, not only we can achieve completeness and soundness property of Zero-Knowledge Proof, but we can also achieve information security property. Index Terms - Feige Flat Shamir, Verification, Zero Knowledge Proof.
Klasifikasi Daun Dengan Perbaikan Fitur Citra Menggunakan Metode K-Nearest Neighbor Febri Liantoni
Ultimatics : Jurnal Teknik Informatika Vol 7 No 2 (2015): Ultimatics: Jurnal Ilmu Teknik Informatika
Publisher : Faculty of Engineering and Informatics, Universitas Multimedia Nusantara

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (671.182 KB) | DOI: 10.31937/ti.v7i2.356

Abstract

Plants are the most important part in life on earth as oxygen supplier to breathe, groceries, fuel, medicine and more. Plants can be classified based on its leaves shape. Classification process is required well data extraction feature, so it needs fixing feature process at pre-processing level. Combining median filter and image erosion is used for fixing feature process. Whereas for feature extraction is used invariant moment method. In this research, it is used leaves classification based on leaves edge shape. K-Nearest Neighbor Method (KNN) is used for leaves classification process. KNN method is chosen because this method is known rapid in training data, effective for large training data, simple and easy to learn. Testing the result of leaves classification from image which is on dataset has been built to get accuracy value about 86,67%. Index Terms—Classification, Median Filter, Invariant Moment, K-Nearest Neighbor.
Kriptografi Citra Menggunakan Metode Rivest-Shamir-Adleman Chinese Remainder Theorem Di Konsultan XYZ Eko Budi Setiawan; Yogie Setiawan Nugraha
Ultimatics : Jurnal Teknik Informatika Vol 7 No 2 (2015): Ultimatics: Jurnal Ilmu Teknik Informatika
Publisher : Faculty of Engineering and Informatics, Universitas Multimedia Nusantara

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1089.456 KB) | DOI: 10.31937/ti.v7i2.357

Abstract

This study basically do image management processes which have no restrictions in about permissions to view the images on the XYZ consultant. This results in image can be easily used by those who do not have the right to open it. Therefore, security research digital image with cryptographic techniques using Rivest Shamir-Adleman With the Chinese Remainder Theorem (RSA-CRT) aims to provide restrictions permissions to view the image, and give the number of restrictions to view images that can be performed by the client. Results of this research is a security application that can create digital images can not be seen without using a specific key and restrictions as well as providing an image to only be opened in a few times. Index Terms— Cryptography, Digital Image, RSACRT, Data Security, Asymmetric Key
Rancang Bangun Aplikasi Penjurusan Minat Bakat Menggunakan Metode Forward Chaining Levi Jordan Halim; Ranny Ranny; P.M. Winarno
Ultimatics : Jurnal Teknik Informatika Vol 7 No 2 (2015): Ultimatics: Jurnal Ilmu Teknik Informatika
Publisher : Faculty of Engineering and Informatics, Universitas Multimedia Nusantara

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (770.321 KB) | DOI: 10.31937/ti.v7i2.358

Abstract

Plentiful choices of Student Activities Unit that offered by a campus like Multimedia Nusantara University can help students who want to choose a unit that suitable for them. The decision support system application with Forward Chaining method is built to help students choosing the Student Activity Unit that suits them. Multiple Intelligence method is used as the knowledge base at making the rules. The aspects that considered as attributes to choosing the Student Activities Unit is the initial interest and also the multiple intelligence scores that the level of conformity will be searched by using Forward Chaining method. This research has produced a knowledge-based decision support system that can help students at choosing Student Activities Unit that suitable for them with the highest accuracy of 86.67 percent. This system is designed in website with PHP and MySQL database programming language. Index Terms—Forward Chaining, Knowledge-based, Multimedia Nusantara University, Multiple Intelligence, Student Activities Unit
Rancang Bangun Aplikasi Peramalan Laba dengan Metode Kuadrat Terkecil Berbasis Android Audrey Sugiarto; Seng Hansun
Ultimatics : Jurnal Teknik Informatika Vol 7 No 2 (2015): Ultimatics: Jurnal Ilmu Teknik Informatika
Publisher : Faculty of Engineering and Informatics, Universitas Multimedia Nusantara

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (920.518 KB) | DOI: 10.31937/ti.v7i2.359

Abstract

The advancement of technology effects in increasing competition between companies. Because of that, companies need more than just raw information, but rather some insight that can help companies to make decisions in the future regarding all the possibilities that can happen. The data that can help the company to make decisions is a forecasting earnings because it can help predict the state of the company has right now, and also can help to make a better decision in the future. Therefore, this study discusses about the design and development of forecasting earnings application using Least Squares Method which will create an equation with the formula, y = ax + b. The method will be implemented based on Android OS at PT TRI PANJI GEMILANG using data from January 2005 to December 2013 (108 months) for data forecasting, and the data used to check the error is data from January 2014 to May 2015 (17 months). Forecasting results have a mean absolute percentage error (MAPE) about 8.26%, with an accuracy of forecasting results about 91.74%. Keywords: android, forecasting, least squares method, profits

Page 6 of 28 | Total Record : 275


Filter by Year

2011 2025


Filter By Issues
All Issue Vol 17 No 1 (2025): Ultimatics : Jurnal Teknik Informatika Vol 16 No 2 (2024): Ultimatics : Jurnal Teknik Informatika Vol 16 No 1 (2024): Ultimatics : Jurnal Teknik Informatika Vol 15 No 2 (2023): Ultimatics : Jurnal Teknik Informatika Vol 15 No 1 (2023): Ultimatics : Jurnal Teknik Informatika Vol 14 No 2 (2022): Ultimatics : Jurnal Teknik Informatika Vol 14 No 1 (2022): Ultimatics : Jurnal Teknik Informatika Vol 13 No 2 (2021): Ultimatics : Jurnal Teknik Informatika Vol 13 No 1 (2021): Ultimatics : Jurnal Teknik Informatika Vol 12 No 2 (2020): Ultimatics : Jurnal Teknik Informatika Vol 12 No 1 (2020): Ultimatics : Jurnal Teknik Informatika Vol 11 No 2 (2019): Ultimatics : Jurnal Teknik Informatika Vol 11 No 1 (2019): Ultimatics : Jurnal Teknik Informatika Vol 10 No 2 (2018): Ultimatics : Jurnal Teknik Informatika Vol 10 No 1 (2018): Ultimatics : Jurnal Teknik Informatika Vol 9 No 2 (2017): Ultimatics : Jurnal Teknik Informatika Vol 9 No 1 (2017): Ultimatics: Jurnal Ilmu Teknik Informatika Vol 8 No 2 (2016): Ultimatics: Jurnal Ilmu Teknik Informatika Vol 8 No 1 (2016): Ultimatics: Jurnal Ilmu Teknik Informatika Vol 7 No 2 (2015): Ultimatics: Jurnal Ilmu Teknik Informatika Vol 7 No 1 (2015): Ultimatics: Jurnal Ilmu Teknik Informatika Vol 6 No 2 (2014): Ultimatics: Jurnal Ilmu Teknik Informatika Vol 6 No 1 (2014): Ultimatics: Jurnal Ilmu Teknik Informatika Vol 5 No 2 (2013): Ultimatics: Jurnal Ilmu Teknik Informatika Vol 5 No 1 (2013): Ultimatics: Jurnal Ilmu Teknik Informatika Vol 4 No 2 (2012): Ultimatics: Jurnal Ilmu Teknik Informatika Vol 4 No 1 (2012): Ultimatics: Jurnal Ilmu Teknik Informatika Vol 3 No 2 (2011): Ultimatics: Jurnal Ilmu Teknik Informatika More Issue