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
-
Editorial Address
-
Location
Kota surabaya,
Jawa timur
INDONESIA
Jurnal Infra
Published by Universitas Kristen Petra Surabaya
ISSN : -     EISSN : -     DOI : -
Core Subject : Science,
Computer Science & IT
Arjuna Subject : -
Articles 54 Documents
 2   3   4   5   6 
Search results for , issue "Vol 9, No 2 (2021)" : 54 Documents clear
Penerapan IoT dan Sistem Pakar untuk Memonitoring Kualitas Air dan Mendiagnosa Penyakit pada Tambak Udang Vaname Kevin Alexander Harianto; Rudy Adipranata; Leo Willyanto Santoso
Jurnal Infra Vol 9, No 2 (2021)
Publisher : Jurnal Infra

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Shrimp’s death is one of the things that is avoided by Vaname shrimp farmers. Where this can occur due to poort water conditions, or the way farmer maintain their shrimp.The problem that the author wants to solve is by utilizing an application that functions to see the condition of water quality using internet of things and using an expert system with the forward chaining method to diagnose if there are symptoms that arise in shrimp.Based on the test that have been carried out, the application made is able to monitor water quality properly and the results of the method test are able eto reach an accuracy value of 100%.
Sistem Penunjang Belanja Pedagang Keliling Di Lokasi Sekitar Menggunakan Haversine Berbasis Android Richard Gozali; Liliana Liliana; Yulia Yulia
Jurnal Infra Vol 9, No 2 (2021)
Publisher : Jurnal Infra

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

A traveling merchant is an effort made by a person to sellgoods/services such as vegetables, fruit, and others by travelingto places with certain routes. During this pandemic, some peoplebuy products online because people are afraid to go to placeswith large crowds. This surge in demand has made many peoplelook for sellers of vegetables and fruits. With this research, it canhelp customers to determine the location of the existence oftraveling merchants in the vicinity.By using the haversine formula, you can find out the approximatedistance between the customer and the traveling merchant.During the pandemic and the habit of staying at home, manypeople prefer to cook for themselves compared to buying. It'shard to decide which dish to cook. With the use of beautifulsoup,you can take the recipe menu of the food you want to make.From the results of the survey given to customers and travelingmerchants, it has been shown that the application is made easy touse and the survey results provide a satisfactory value. Based ontesting the distance between haversine and google maps. Theresulting haversine formula is quite accurate when compared togoogle maps. The results of the comparison of the averagedistance produced are 0.315 Km.
Indoor Room Recognition Menggunakan Multiple Instance Learning Convolutional Neural Networks Yehezkiel Wuisang; Djoni Haryadi Setiabudi; Alvin Nathaniel Tjondrowiguno
Jurnal Infra Vol 9, No 2 (2021)
Publisher : Jurnal Infra

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Environment recognition is a modern problem that appears in this modern era. One of them is how a room’s type can be identified. Indoor room is a very challenging environment to identify because the identity of a room is represented by various types of objects in the room which by itself have various sizes and shapes. With the development of technology, especially machine learning, the type of room can be recognized automatically by a system with the help of Image Processing and Artificial Neural Network. This study uses the Mean-Shift algorithm to segment images and the Convolutional Neural Network (CNN) method assisted by the application of Multiple Instance Learning (MIL) so as to form the Multiple Instance Learning Convolutional Neural Network (MILCNN) method to identify room types. During training and testing, adjustments will be made to the method so that it can be applied in recognizing room types only through image labels without looking for individual object labels on images. This study classifies the room that contains an image by recognizing the features of the objects in it. The final result from testing the dataset produces a classification accuracy percentage that reaches 43.05%.
Aplikasi Segmentasi Pelanggan menggunakan Algoritma RFM/P dan Kmeans Clustering pada PT. XYZ Priscilla Delaya; Andreas Handojo; Alexander Setiawan
Jurnal Infra Vol 9, No 2 (2021)
Publisher : Jurnal Infra

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Customers are one of the keys to the resilience of a business. Each customer has different behavior and needs, so they need different treatment. Intense competition in the retail business makes customers have many choices and can easily switch to other companies. As a solution for PT. XYZ to compete, a customer segmentation system is needed to help PT. XYZ understand and maintain their customer’s loyalty. Therefore, in this study, the RFM/P method was used to calculate customer value, which was then followed by Kmeans clustering to divide customers into three clusters, namely below zeroes, most growable customers, and most valuable customers for each product. The results of the questionnaire evaluation in system testing were carried out on 6 respondents, for application functionality 93% good, application design 90% good, ease of use of application 83% good, application responding to needs 90% good, and overall application 87% good.

Page 6 of 6 | Total Record : 54

 2   3   4   5   6 

Filter by Year

2021 2021


Reset
Filter By Issues
All Issue Vol 10, No 2 (2022) Vol 10, No 1 (2022) Vol 9, No 2 (2021) Vol 9, No 1 (2021) Vol 8, No 2 (2020) Vol 8, No 1 (2020) Vol 7, No 2 (2019) Vol 7, No 1 (2019) Vol 6, No 2 (2018) Vol 6, No 2 (2018) Vol 6, No 1 (2018) Vol 5, No 2 (2017) Vol 5, No 1 (2017) Vol 4, No 2 (2016) Vol 4, No 1 (2016) Vol 4, No 1 (2016) Vol 3, No 2 (2015) Vol 3, No 2 (2015) Vol 3, No 1 (2015) Vol 3, No 1 (2015) Vol 2, No 2 (2014) Vol 2, No 2 (2014) Vol 2, No 1 (2014) Vol 2, No 1 (2014) Vol 1, No 2 (2013) Vol 1, No 2 (2013) Vol 1, No 1 (2013) Vol 1, No 1 (2013) More Issue