Garuda - Garba Rujukan Digital

LOGIKA FUZZY UNTUK MENENTUKAN MINAT WISATA MASYARAKAT DI KOTA BATAM Alvendo Wahyu Aranski; Franky Chia
Jurnal Informatika Vol 18, No 2 (2018): Jurnal Informatika
Publisher : IIB Darmajaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30873/ji.v18i2.675

Batam is a city with millions of tourism potential in the future. With its geographical location is very strategic, the city of Batam should be a tourist destination for all people, especially the people of Batam city itself. However, the lack of tourist interest for the community in Batam City caused several factors such as distance to the location of the tour, the facilities provided, and entrance fees to the tourist attractions. By using Mamdani method on Fuzzy logic, determination of tourism interest for Batam city community can be done. With a value of 43 on the results of matlab calculation, stated that the interest of community tourism in the city of Batam is in the fuzzy set quite interested.Keywords—Mamdani, Fuzzy, Tourismn

FINITE STATE AUTOMATA DAN LOGIKA FUZZY DALAM PEMILIHAN PAKET PELAMINAN DI KOTA BATAM Koko Handoko; Alvendo Wahyu Aranski
JURNAL TEKNOLOGI DAN OPEN SOURCE Vol 2 No 2 (2019): Jurnal Teknologi dan Open Source, December 2019
Publisher : Universitas Islam Kuantan Singingi

Marriage is something that is highly desirable for every potential partner in life. Marriage is considered a sacred activity so it needs to be well planned and mature. The growing development of a business in Batam city makes this business mushrooming because it is definitely needed by every couple who will get married. The availability of a wedding package helps each couple to choose an existing package, both in terms of price, type of tent to be used, number of clothes, and wedding photographer services. In this study, researchers conducted a determination of the problem in the form of a wedding package selection, looking for literature in accordance with the problems in the form of books and journals, analysis with fuzzy logic with the Mamdani method to complete the exact calculations so that prospective brides who will choose the aids package can choose the package that in accordance with the wishes and budget provided. The use of fuzzy logic and the Mamdani method will be assisted by Finite State Automata in making the rule design of fuzzy logic. Output targets achieved in the form of analysis of the determination of the package in the form of fuzzy logic calculations, system design from the analysis stage, retrieval of real data from each aisle in the city of Batam, and the target in the first year in the form of a determination package relevant to every wedding in the city of Batam.

DATA MINING DALAM PENGELOMPOKAN NILAI IQ SISWA Alvendo Wahyu Aranski; Koko Handoko
JURNAL TEKNOLOGI DAN OPEN SOURCE Vol 2 No 2 (2019): Jurnal Teknologi dan Open Source, December 2019
Publisher : Universitas Islam Kuantan Singingi

Education is one aspect of life that should be owned by every human being. The most crucial times for education is during school. During school, students will start from kindergarten until finally graduating at the high school level. One aspect that is highly considered during school is the level of intelligence. Intelligence levels are often associated with IQ levels. According to research, a person's IQ level becomes a benchmark on the level of intelligence of that person. The level of intelligence can affect the lives of students in receiving lessons so well that the school should properly classify students. Grouping students based on IQ level aims that students can receive more appropriate and effective learning methods so that students can receive lessons well. At Yos Sudarso Highschool at Batam, there are a lot of students who enroll and grouping students will take a lot of time and is not efficient if done manually. Grouping students can be done quickly and precisely by utilizing data mining. One method in data mining is clustering by using K-means. The stages of this method begin with random selection K, K here is the number of clusters that you want to form. Then set K values randomly, while the value becomes the center of the cluster or commonly referred to as centroid, mean or "means". Calculating the distance of each existing data on each centroid using the Euclidian formula to find the closest distance from each data with the centroid after the manual calculation is run on the data mining software, RapidMiner. The use of the K-means method for grouping is one of the right methods when viewed from the variables to be used, namely the value of the student's IQ level. This ¬K-means method will form clusters that classify students based on IQ levels. By applying data mining clustering with the K-means method it is hoped that it can help the school in classifying students appropriately so as to facilitate the school in ensuring students get the right learning method.

Analisis Potensi Wisata Menggunakan Logika Fuzzy Alvendo Wahyu Aranski
JURNAL ILMIAH INFORMATIKA Vol 6 No 01 (2018): Jurnal Ilmiah Informatika (JIF)
Publisher : Teknik Informatika

Pariwisata merupakan salah satu ikon utama yang dikembangkan oleh pemerintah kota Batam saat ini. Pada tahu 2020, Batam diproklamasikan sebagai tujuan wisata yang dikelola dengan baik. Tidak hanya bergerak dibidang industri, Batam juga nantinya akan dikenal sebagai kota wisata. Hal ini terbukti dari banyaknya kawasan wisata yang sedang berkembang baik yang dikelola oleh pemerintahan, maupun pihak swasta. Semakin banyak tempat wisata yang ada, membuat beberapa infrastruktur jalan sedang dibangun. Tujuannya agar tempat wisata bisa diakses dengan mudah. Logika fuzzy dengan metode mamdani memiliki kemampuan yang dapat digunakan untuk menganalisis potensi wisata di kota Batam. Dengan analisis potensi wisata ini, akan membuat tempat wisata di kota Batam ramai pengunjung, baik wisatawan lokal maupun mancanegara. Analisis ini bisa digunakan juga untuk pengelola baik pemerintah atau swasta untuk melihat potensi wisata yang ada. Analisis ini juga dapat memberikan pertimbangan bagi wisatawan untuk datang dan menjelajahi tempat-tempat wisata baru di kota Batam.

APLIKASI PENDETEKSI DINI KECANDUAN PENGGUNAAN SMARTPHONE TERHADAP PRODUKTIVITAS KERJA MENGGUNAKAN LOGIKA FUZZY Alvendo Wahyu Aranski
JURNAL ILMIAH INFORMATIKA Vol 6 No 02 (2018): Jurnal Ilmiah Informatika (JIF)
Publisher : Teknik Informatika

The development of smartphones at this time is very rapid. Within 1 year the bias appeared various kinds and models. The growing technology, especially smartphones, has an impact on work productivity. In one day, people can access their smartphonenya about 15-50 times. This results in decreased work productivity. With the help of fuzzy logic and applied into the app, the bias detects a quick addiction to smartphone usage. Personnel of a company, can use this application so that the productivity of employees work can be known as early as possible. From the existing calculations, obtained results that addiction to the use of smartphones affect the productivity of work as much as 80 in accordance with the existing numbers on matlab calculations. This 80 figure shows a very large part of his addiction to smartphone usage.

Optimization of The Smallest Road Using The Traveling Salesman Problem (TSP) Method Alvendo Wahyu Aranski
IJISTECH (International Journal of Information System and Technology) Vol 6, No 1 (2022): June
Publisher : Sekolah Tinggi Ilmu Komputer (STIKOM) Tunas Bangsa

Optimization is the process of obtaining a minimum (small) or maximum (largest) value in an opportunity function. One case that uses the optimization function is the Traveling Salesman Problem (TSP). The case study problem in this research is to find the shortest route to a destination city in order to get a short time to get to that city and save time and costs on the way. The completion of the search for the shortest route uses the TSP concept. Basic concepts in running CSR 1. The journey starts and ends in the same city as the original city of the salesperson. 2. Entire cities must be visited without missing a single city.3. Sales are not allowed to return to the city of origin before all cities have been visited. By using this method, the distance between each city will be analyzed. The cities that the salesman will go to consist of 4 cities A, B, C, and D with a combination process to obtain as many as 24 lanes that can be passed by the salesman. From each route taken by the salesman, there are 2 shortest paths that can be used as alternatives, including the CABD=17+15+19=51 route and the DBAC=19+15+17=51 route. The final results of this study can be used as a reference in determining the shortest route by salesmen with a distance value of 15.

Optimization of The Smallest Road Using The Traveling Salesman Problem (TSP) Method Alvendo Wahyu Aranski
IJISTECH (International Journal of Information System and Technology) Vol 6, No 1 (2022): June
Publisher : Sekolah Tinggi Ilmu Komputer (STIKOM) Tunas Bangsa

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30645/ijistech.v6i1.224

Optimization is the process of obtaining a minimum (small) or maximum (largest) value in an opportunity function. One case that uses the optimization function is the Traveling Salesman Problem (TSP). The case study problem in this research is to find the shortest route to a destination city in order to get a short time to get to that city and save time and costs on the way. The completion of the search for the shortest route uses the TSP concept. Basic concepts in running CSR 1. The journey starts and ends in the same city as the original city of the salesperson. 2. Entire cities must be visited without missing a single city.3. Sales are not allowed to return to the city of origin before all cities have been visited. By using this method, the distance between each city will be analyzed. The cities that the salesman will go to consist of 4 cities A, B, C, and D with a combination process to obtain as many as 24 lanes that can be passed by the salesman. From each route taken by the salesman, there are 2 shortest paths that can be used as alternatives, including the CABD=17+15+19=51 route and the DBAC=19+15+17=51 route. The final results of this study can be used as a reference in determining the shortest route by salesmen with a distance value of 15.

Depth First Search Algorithm In Solving the Shortest Route Using the Concept of Generate and Test Alvendo Wahyu Aranski
IJISTECH (International Journal of Information System and Technology) Vol 6, No 3 (2022): October
Publisher : Sekolah Tinggi Ilmu Komputer (STIKOM) Tunas Bangsa

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30645/ijistech.v6i3.249

Depth First Search Algorithm is a search process to find the right solution that requires short memory and time in finding the Goal. The problem in this research is the difficulty of salesmen to find alternative short routes to arrive at the final node as consideration for finding solutions. The purpose of this study is to find the shortest path so that salesmen can easily and quickly get to the final solution by saving time and mileage. The Generate And Test concept consists of combining the Depth first search algorithm with the backward tracking process. All processes must be completed before the testing process is carried out. If the General And Test process is carried out sequentially or systematically, it will get the best value in finding a solution, the weakness if the search process is large or extensive then the search process takes a very long time. How it works Generatr and test, namely 1. Generate possible solutions in the form of state states with the concept of a one-position path to the destination path. 2. Test, select whether the solution can be accepted according to the existing criteria 3. If the solution has got the Goal then the search is stopped, if not then the process is continued until finding a solution. The final result of testing the shortest route is A-B-E-J-P-S-U = 25+21+24+24+17+18=129

Depth First Search Algorithm In Solving the Shortest Route Using the Concept of Generate and Test Alvendo Wahyu Aranski
IJISTECH (International Journal of Information System and Technology) Vol 6, No 3 (2022): October
Publisher : Sekolah Tinggi Ilmu Komputer (STIKOM) Tunas Bangsa

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30645/ijistech.v6i3.249

Depth First Search Algorithm is a search process to find the right solution that requires short memory and time in finding the Goal. The problem in this research is the difficulty of salesmen to find alternative short routes to arrive at the final node as consideration for finding solutions. The purpose of this study is to find the shortest path so that salesmen can easily and quickly get to the final solution by saving time and mileage. The Generate And Test concept consists of combining the Depth first search algorithm with the backward tracking process. All processes must be completed before the testing process is carried out. If the General And Test process is carried out sequentially or systematically, it will get the best value in finding a solution, the weakness if the search process is large or extensive then the search process takes a very long time. How it works Generatr and test, namely 1. Generate possible solutions in the form of state states with the concept of a one-position path to the destination path. 2. Test, select whether the solution can be accepted according to the existing criteria 3. If the solution has got the Goal then the search is stopped, if not then the process is continued until finding a solution. The final result of testing the shortest route is A-B-E-J-P-S-U = 25+21+24+24+17+18=129

Pemanfaatan Algoritma Hebb Rule Mendiagnosis Kerusakan Elektroda Pada Proses Welding Frame Thermostat Alvendo Wahyu Aranski; Sestri Novia Rizki
JURIKOM (Jurnal Riset Komputer) Vol 9, No 6 (2022): Desember 2022
Publisher : STMIK Budi Darma

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30865/jurikom.v9i6.5335

In the current era of technological development, developments in computer systems are very fast, computerized systems are needed at this time, including to diagnose electrodes in the welding process, frame thermostats on soulplate, because sometimes it's mechanical. Mechanics find it difficult to detect damage to machines due to the absence of a good computerized system. The use of SMAW (Shielded Metal Arc Welding) in the industrial world is quite widely used. With this machine humans are greatly helped by the need to make a metal object. So that with the frequent use of these tools, it will also be more vulnerable to damage to these tools. The machine technicians supplied by the company are not proportional to the number of machines. Therefore, to help solve the problem. The purpose of this research is to make it easier for mechanics to detect engine damage. This study uses the Hebb Rule method with the simplest learning method concept. In this method learning is done by fixing the weight values in such a way that if there are 2 connected neurons, and both are 'on' at the same time, then the weight between the two is increased. If the data is represented in a bipolar manner, then the weight is improved. Therefore this method is very useful in solving a problem that occurs. The final result of this research is 1, in which the network can understand the intended pattern. It has a value of 1 because it uses a binary number pattern, not bipolar.

Title

Found 20 Documents
Search

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title Search

Found 20 Documents Search

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title

Found 20 Documents
Search