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
juti.if@its.ac.id
Editorial Address
Gedung Teknik Informatika Lantai 2 Ruang IF-230, Jalan Teknik Kimia, Kampus ITS Sukolilo, Surabaya, 60111
Location
Kota surabaya,
Jawa timur
INDONESIA
JUTI: Jurnal Ilmiah Teknologi Informasi
Published by Institut Teknologi Sepuluh Nopember Surabaya
ISSN : 24068535     EISSN : 14126389     DOI : http://dx.doi.org/10.12962/j24068535
Core Subject : Health, Science, Education,
Computer Science & IT Dentistry Education Library & Information Science
JUTI (Jurnal Ilmiah Teknologi Informasi) is a scientific journal managed by Department of Informatics, ITS.
Arjuna Subject : -
Articles 389 Documents
 30   31   32   33   34 
IMPLEMENTATION OF MULTILAYER PERCEPTRON FOR STUDENT FAILURE PREDICTION Haryawan, Cosmas; Sebatubun, Maria Mediatrix
JUTI: Jurnal Ilmiah Teknologi Informasi Vol. 18, No. 2, July 2020
Publisher : Department of Informatics, Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/j24068535.v18i2.a990

Abstract

University is one of the educational institutions and can be established by the government or the individual. At this time, Indonesia has hundreds of universities spread throughout the region. As an educational institution, university of course must be able to educate its students and issue quality graduates with the academically and non-academically qualified. In its implementation, there are many problems that should be resolved as well as possible, such as when there are students who intentionally stop or disappear before completing their education or are even unable to complete their education and issued by institution (dropout).Based on these problems, this research makes a model for predicting students who have the potential to fail or dropout during their studies using one of the data mining methods namely Multilayer Perceptron by referring to personal and academic data. The results obtained from this research are 86.9% an accuracy rate with the 54.7% sensitivity, and 95.4% specificity. This research is expected to be used to determine the need strategies to minimize the number of students who stop or dropout.
REMARKETING MEDIA ALTERNATIVES BASED ON CUSTOMER PREFERENCES Ahmadiyah, Adhatus Solichah; Aidah, Faridatul; Meutia, Navinda; Rahmadina, Denise; Lumbantobing, Daniel; Anggraini, Ratih
JUTI: Jurnal Ilmiah Teknologi Informasi Vol. 18, No. 2, July 2020
Publisher : Department of Informatics, Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/j24068535.v18i2.a1007

Abstract

Remarketing is a powerful tool for marketers to offer products over and over to existing customers or potential customers. By using remarketing, the marketers target to further down their sales funnel. As in traditional marketing, most online marketers find it challenging to deliver the best way of advertising their products according to what customers need or like. This research aims to achieve the right promotional media alternatives based on customer preferences. A clustering method was used to perform behavior segmentation on sales data. Then, customer reviews on the purchased products collected from online platforms were analyzed to obtain customer preferences. Finally, customer preference was mapped to some suitable promotion media. The experiment result showed that pipelining sales data and product reviews could obtain definite and distinct promotional media based on customer preference. Overall, this research may help online marketers bundle specific remarketing content into promotional media that matches to customer favorites.
GECOM: GREEN COMMUNICATION CONCEPTS FOR ENERGY EFFICIENCY IN WIRELESS MULTIMEDIA SENSOR NETWORK Diputra, Muhammad Ihsan; Megantara, Ahmad Akbar; Safitri, Pima Hani; Purwanto, Didik
JUTI: Jurnal Ilmiah Teknologi Informasi Vol. 18, No. 2, July 2020
Publisher : Department of Informatics, Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/j24068535.v18i2.a942

Abstract

Wireless multimedia sensor network (WMSN) is one of broad wide application for developing a smart city. Each node in the WMSN has some primary components: sensor, microcontroller, wireless radio, and battery. The components of WMSN are used for sensing, computing, communicating between nodes, and flexibility of placement. However, the WMSN technology has some weakness, i.e. enormous power consumption when sending a media with a large size such as image, audio, and video files. Research had been conducted to reduce power consumption, such as file compression or power consumption management, in the process of sending data. We propose Green Communication (GeCom), which combines power control management and file compression methods to reduce the energy consumption. The power control management method controls data transmission. If the current data has high similarity with the previous one, then the data will not be sent. The compression method compresses massive data such as images before sending the data. We used the low energy image compression algorithm algorithm to compress the data for its ability to maintain the quality of images while producing a significant compression ratio. This method successfully reduced energy usage by 2% to 17% for each data.   
DELINEATION OF ECG FEATURE EXTRACTION USING MULTIRESOLUTION ANALYSIS FRAMEWORK Hikmah, Nada Fitrieyatul; Arifin, Achmad; Sardjono, Tri Arief
JUTI: Jurnal Ilmiah Teknologi Informasi Vol. 18, No. 2, July 2020
Publisher : Department of Informatics, Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/j24068535.v18i2.a992

Abstract

ECG signals have very features time-varying morphology, distinguished as P wave, QRS complex, and T wave. Delineation in ECG signal processing is an important step used to identify critical points that mark the interval and amplitude locations in the features of each wave morphology. The results of ECG signal delineation can be used by clinicians to associate the pattern of delineation point results with morphological classes, besides delineation also produces temporal parameter values of ECG signals. The delineation process includes detecting the onset and offset of QRS complex, P and T waves that represented as pulse width, and also the detection of the peak from each wave feature. The previous study had applied bandpass filters to reduce amplitude of P and T waves, then the signal was passed through non-linear transformations such as derivatives or square to enhance QRS complex. However, the spectrum bandwidth of QRS complex from different patients or same patient may be different, so the previous method was less effective for the morphological variations in ECG signals. This study developed delineation from the ECG feature extraction based on multiresolution analysis with discrete wavelet transform. The mother wavelet used was a quadratic spline function with compact support. Finally, determination of R, T, and P wave peaks were shown by zero crossing of the wavelet transform signals, while the onset and offset were generated from modulus maxima and modulus minima. Results show the proposed method was able to detect QRS complex with sensitivity of 97.05% and precision of 95.92%, T wave detection with sensitivity of 99.79% and precision of 96.46%, P wave detection with sensitivity of 56.69% and precision of 57.78%. The implementation in real time analysis of time-varying ECG morphology will be addressed in the future research.
DEVELOPMENT OF LOAD BALANCING MECHANISMS IN SDN DATA PLANE FAT TREE USING MODIFIED DIJKSTRA’S ALGORITHM Rangkuty, Muhammad Fattahilah; Ijtihadie, Royyana Muslim; Ahmad, Tohari
JUTI: Jurnal Ilmiah Teknologi Informasi Vol. 18, No. 2, July 2020
Publisher : Department of Informatics, Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/j24068535.v18i2.a1008

Abstract

SDN is a computer network approach that allows network administrators to manage network services through the abstraction of functionality at a higher level, by separating systems that make decisions about where traffic is sent (control plane), then forwarding traffic to the chosen destination (data plane). SDN can have problems with network congestion, high latency, and decreased throughput due to unbalanced traffic allocation on available links, so a load-balancing load method is needed. This technique divides the entire load evenly on each component of the network on the path or path that connects the data plane and S-D (Source Destination) host. The Least Loaded Path (LLP) of our proposed concept, which is a Dijkstra development, selects the best path by finding the shortest path and the smallest traffic load, the smallest traffic load (minimum cost) obtained from the sum of tx and rx data in the switchport data plane involved in the test, this result which will then be determined as the best path in the load balancing process.
GCRFP - PAGE REPLACEMENT FOR SOLID STATE DRIVE USING GHOST-CACHE Suadi, Wahyu; Djanali, Supeno; Wibisono, Waskitho; Anggoro, Radityo; Shiddiqi, Ary Mazharuddin
JUTI: Jurnal Ilmiah Teknologi Informasi Vol. 18, No. 2, July 2020
Publisher : Department of Informatics, Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/j24068535.v18i2.a986

Abstract

State Drive (SSD) is an alternative to data storage that is popular today, widely used as a media cache to speed up data access to the hard disk (HDD). This paper proposes page replacement technique on SSD cache that used frequency and recency parameter, alternately. The algorithm is selected adaptively based on trace input. This method helps to overcome changes in access patterns while minimizing the number of write processes to SSD. The proposed algorithm can choose a replacement technique that suits the user access pattern so that it can bring a better hit rate. The proposed algorithm is also integrated with the ghost-cache mechanism so that the reduction in the number of writing processes to SSD is significant. The experiment runs using a real dataset, describing trace of data read, and data write taken from real usage. The trial shows that the proposed algorithm can give good results compared to other similar algorithms.
APPLIED MACHINE LEARNING IN LOAD BALANCING Junaidi, Junaidi; Wibowo, Prasetyo; Yuniasri, Dini; Damayanti, Putri; Shiddiqi, Ary Mazharuddin; Pratomo, Baskoro Adi
JUTI: Jurnal Ilmiah Teknologi Informasi Vol. 18, No. 2, July 2020
Publisher : Department of Informatics, Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/j24068535.v18i2.a940

Abstract

A common way to maintain the quality of service on systems that are growing rapidly is by increasing server specifications or by adding servers. The utility of servers can be balanced with the presence of a load balancer to manage server loads. In this paper, we propose a machine learning algorithm that utilizes server resources CPU and memory to forecast the future of resources server loads. We identify the timespan of forecasting should be long enough to avoid dispatcher's lack of information server distribution at runtime. Additionally, server profile pulling, forecasting server resources, and dispatching should be asynchronous with the request listener of the load balancer to minimize response delay. For production use, we recommend that the load balancer should have friendly user interface to make it easier to be configured, such as adding resources of servers as parameter criteria. We also recommended from beginning to start to save the log data server resources because the more data to process, the more accurate prediction of server load will be.
FACIAL INPAINTING IN UNALIGNED FACE IMAGES USING GENERATIVE ADVERSARIAL NETWORK WITH FEATURE RECONSTRUCTION LOSS Maulana, Avin; Fatichah, Chastine; Suciati, Nanik
JUTI: Jurnal Ilmiah Teknologi Informasi Vol. 18, No. 2, July 2020
Publisher : Department of Informatics, Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/j24068535.v18i2.a1004

Abstract

Facial inpainting or face restoration is a process to reconstruct some missing region on face images such that the inpainting results still can be seen as a realistic and original image without any missing region, in such a way that the observer could not realize whether the inpainting result is a generated or original image. Some of previous researches have done inpainting using generative network, such as Generative Adversarial Network. However, some problems may arise when inpainting algorithm have been done on unaligned face. The inpainting result show spatial inconsistency between the reconstructed region and its adjacent pixel, and the algorithm fail to reconstruct some area of face. Therefore, an improvement method in facial inpainting based on deep-learning is proposed to reduce the effect of the stated problem before, using GAN with additional loss from feature reconstruction and two discriminators. Feature reconstruction loss is a loss obtained by using pretrained network VGG-Net, Evaluation of the result shows that additional loss from feature reconstruction loss and two type of discriminators may help to increase visual quality of inpainting result, with higher PSNR and SSIM than previous result.
PREDICT URBAN AIR POLLUTION IN SURABAYA USING RECURRENT NEURAL NETWORK – LONG SHORT TERM MEMORY Faishol, Muh. Anas; Endroyono, Endroyono; Irfansyah, Astria Nur
JUTI: Jurnal Ilmiah Teknologi Informasi Vol. 18, No. 2, July 2020
Publisher : Department of Informatics, Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/j24068535.v18i2.a988

Abstract

Air is one of the primary needs of living things. If the condition of air is polluted, then the lives of humans and other living things will be disrupted. So it is needed to perform special handling to maintain air quality. One way to facilitate the prevention of air pollution is to make air pollutionforecasting by utilizing past data. Through the Environmental Office, the Surabaya City Government has monitored air quality in Surabaya every 30 minutes for various air quality parameters including CO, NO, NO2, NOx, PM10, SO2 and meteorological data such as wind direction, wind direction, wind speed, wind speed, global radiation, humidity, and air temperature. These data are very useful to build a prediction model for the forecast of air pollution in the future. With the large amount and variance of data generated from monitoring air quality in Surabaya city, a qualified algorithm is needed to process it. One algorithm that can be used is Recurrent Neural Network - Long Short Term Memory (RNN-LSTM). RNN-LSTM is built for sequential data processing such as time-series data. In this study, several analyses are performed. There are trend analysis, correlation analysis of pollutant values to meteorological data, and predictions of carbon monoxide pollutants using the Recurrent Neural Network - LSTM in the city of Surabaya correlated with meteorological data. The results of this study indicate that the best prediction model using RNN-LSTM with RMSE calculation gets an error of 1,880 with the number of hidden layer 2 and epoch 50 scenarios. The predicted results built can be used as a reference in determining the policy of the city government to deal with air pollution going forward.
CONTINUOUS MULTIQUERIES K-DOMINANT SKYLINE ON ROAD NETWORK Muttaqi, Syukron Rifail; Santoso, Bagus Jati
JUTI: Jurnal Ilmiah Teknologi Informasi Vol. 18, No. 2, July 2020
Publisher : Department of Informatics, Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/j24068535.v18i2.a999

Abstract

The increasing use of mobile devices makes spatial data worthy of consideration. To get maximum results, users often look for the best from a collection of objects. Among the algorithms that can be used is the skyline query. The algorithm looks for all objects that are not dominated by other objects in all of its attributes. However, data that has many attributes makes the query output a lot of objects so it is less useful for the user. k-dominant skyline queries can be a solution to reduce the output. Among the challenges is the use of skyline queries with spatial data and the many user preferences in finding the best object. This study proposes IKSR: the k-dominant skyline query algorithm that works in a road network environment and can process many queries that have the same subspace in one processing. This algorithm combines queries that operate on the same subspace and set of objects with different k values by computing from the smallest to the largest k. Optimization occurs when some data for larger k are precomputed when calculating the result for the smallest k so the Voronoi cell computing is not repeated. Testing is done by comparing with the naïve algorithm without precomputation. IKSR algorithm can speed up computing time two to three times compared to naïve algorithm.

Page 32 of 39 | Total Record : 389

 30   31   32   33   34 

Filter by Year

2002 2025


Reset
Filter By Issues
All Issue Vol.23, No.2, July 2025 Vol. 23, No. 1, January 2025 Vol. 22, No. 2, July 2024 Vol. 22, No. 1, January 2024 Vol. 21, No. 2, July 2023 Vol. 21, No. 1, January 2023 Vol. 20, No. 2, July 2022 Vol. 20, No. 1, January 2022 Vol. 19, No. 2, Juli 2021 Vol. 19, No. 1, Januari 2021 Vol. 18, No. 2, July 2020 Vol. 18, No. 1, January 2020 Vol. 17, No. 2, Juli 2019 Vol 17, No. 1, Januari 2019 Vol 16, No. 2, Juli 2018 Vol 16, No. 1, Januari 2018 Vol 15, No. 2, Juli 2017 Vol 15, No. 1, Januari 2017 Vol 14, No. 2, Juli 2016 Vol 14, No 1, Januari 2016 Vol 13, No 2, Juli 2015 Vol 13, No 1, Januari 2015 Vol 12, No 2, Juli 2014 Vol 12, No 1, Januari 2014 Vol 11, No 2, Juli 2013 Vol 11, No 1, Januari 2013 Vol 10, No 2, Juli 2012 Vol 10, No 1, Januari 2012 Vol 9, No 2, Juli 2011 Vol 9, No 1, Januari 2011 Vol 8, No 2, Juli 2010 Vol 8, No 1, Januari 2010 Vol 7, No 4, Juli 2009 Vol 7, No 3, Januari 2009 Vol 7, No 2, Juli 2008 Vol 7, No 1, Januari 2008 Vol 6, No 2 Juli 2007 Vol 6, No 1 Januari 2007 Vol 5, No 2 Juli 2006 Vol 5, No 1 Januari 2006 Vol 4, No 2 Juli 2005 Vol 4, No 1 Januari 2005 Vol 3, No 2 Juli 2004 Vol 3, No 1 Januari 2004 Vol 2, No 2 Juli 2003 Vol 2, No 1 Januari 2003 Vol 1, No 1 Juli 2002 More Issue