cover
Contact Name
-
Contact Email
-
Phone
-
Journal Mail Official
-
Editorial Address
-
Location
Kab. jember,
Jawa timur
INDONESIA
INFORMAL: Informatics Journal
Published by Universitas Jember
ISSN : 2503250X     EISSN : -     DOI : -
Core Subject : Science,
Arjuna Subject : -
Articles 219 Documents
Sistem Informasi Penilaian Supplier Komputer Menggunakan Metode Fuzzy Multiple Attribute Decision Making Dengan Simple Additive Weighting Johana Harjayanti; Anief Fauzan Rozi
INFORMAL: Informatics Journal Vol 1 No 3 (2016): INFORMAL: INFORMATICS JOURNAL
Publisher : Faculty of Computer Science, University of Jember

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

Abstract

Supplier sebagai mitra bisnis telah mengambil peranan penting dalam proses bisnis dan keberhasilan suatu perusahaan. Apabila supplier tidak dapat memenuhi permintaan perusahaan dalam pengadaan bahan baku maupun peralatan pendukung operasional yang sesuai dengan kriteria dan kebutuhan perusahaan, maka proses bisnis dalam perusahaan akan terhambat dan dapat menimbulkan kerugian bagi perusahaan. Mengingat supplier mempunyai peranan penting dalam proses bisnis perusahaan, maka tujuan dari penelitian ini adalah menentukan penilaian terhadap supplier sebagai penyedia barang, sehingga perusahaan dapat mempertimbangkan apakah akan melanjutkan kerjasama dengan supplier tersebut atau tidak. Dalam studi kasus ini PT. XYZ memiliki beberapa supplier pendukung operasional dalam hal ini peralatan pendukung teknologi informasi (Laptop, PC, Monitor, Printer, Part Komputer). Penelitian ini menggunakan 9 kriteria sebagai parameter penilaian, agar dapat membuat keputusan yang tepat dalam penelitian ini maka digunakan metode Fuzzy Multiple Attribute Decision Making (FMADM) dan Simple Additive Weighting (SAW) dengan mencari penjumlahan terbobot dari rating kinerja pada setiap alternatif pada semua atribut. Hasil perhitungan menggunakan metode perusahaan menghasilkan nilai untuk supplier A1 sebesar 3.11, sedangkan supplier A2 sebesar 3.67. Sedangkan perhitungan menggunakan sistem menghasilkan nilai untuk supplier A1 sebesar 5.56 dan supplier A2 sebesar 6.56. Sehingga dapat disimpulkan bahwa perhitungan menggunakan metode perusahaan dan menggunakan sistem memberikan perbandingan yang sesuai.
Kajian Penerapan Semi-Automated Evaluation Based on Similarity pada Investigasi Digital Image Forensics Astrid Lestari Tungadi; Erick Alfons Lisangan
INFORMAL: Informatics Journal Vol 1 No 2 (2016): INFORMAL : Informatics Journal
Publisher : Faculty of Computer Science, University of Jember

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

Abstract

Along with the development of information technology, is now widely available for image processing applications are easy to use. It has an impact on the process of manipulation and modification of the image to be more easily so it is quite difficult to determine the authenticity of an image. Image evaluation methods have been developed automatically. The weaknesses are irrelevant parts of the image will be processed so as not efficient in terms of processing time. User Role (semi-automatic) for assessing the relevance of an image section can be helpful in the evaluation method. Similarity-based approach, one of them using the Euclidean distance, either automatic or semi-automatic allows forensic computer analysis process becomes faster. Preparation of the ranking of the data that has similarities allows users to investigate the authenticity of the picture. In this paper tried to assess the implementation of semi-automatic evaluation of similarity based on a forensic image. In the method of analysis, there are two stages, namely the conduct of the evaluation results ranking image block that requires verification of the user so that the second stage is only relevant image blocks are analyzed automatically. The results showed that the use of semi-automatic evaluation methods based on computer forensic similarity not only be done on the data string but also the image data.
Menentukan Bibit Kopi yang Cocok Ditanam di Kecamatan Sumberjambe Kabupaten Jember Menggunakan Metode Forward Chaining Yanuar Nurdiansyah; Iron Wardana; Muhammad Tajuddin; Nuril Ilmi Al Islami Ilmi Al Islami
INFORMAL: Informatics Journal Vol 2 No 3 (2017): INFORMAL - Informatics Journal
Publisher : Faculty of Computer Science, University of Jember

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

Abstract

Kopi merupakan salah satu komoditas yang memiliki peranan penting dalam pembangunan nasional Indonesia. Salah satu wilayah perkebunan kopi di Kabupaten Jember adalah Kecamatan Sumberjambe yang tergolong dataran tinggi. Pada dasarnya syarat tumbuhnya kopi memiliki banyak faktor, tetapi yang diambil hanya beberapa sampel yaitu, ketinggian tempat, curah hujan dan suhu, ke tiga faktor tersebut menjadi fokus dalam penelitian sehingga bisa menjadi bahan pertimbangan untuk menentukan jenis kopi yang cocok ditanam di daerah Sumberjambe, menggunakan algoritma forward chaining. yang merupakan metode pencarian dimulai dengan mencari informasi umum dan informasi khusus yang terdapat di lapangan kemudian penggabungan aturan tertentu untuk menghasilkan dua kesimpulan. Langkah terakhir yaitu, mencocokkan kesimpulan menggunakan informasi umum dengan informasi dilapangan dan menghasilkan tujuan yang dibutuhkan berupa kecocokan syarat tumbuh dan jenis kopi. Dengan metode ini data yang dicocokkan dan dihasilkan lebih tepat karena kesesuaian perbandingan syarat tumbuh dan jenis kopi akan sesuai dengan kriteria yang ditentukan.
Strategi Menemukan Jalan Keluar Labirin dengan Waktu Tercepat Menggunakan Metode DFS Mustika Rahmasuci; Husnul Hotimatus s; Maulia Azizah; Putri Wulandari; Diah Adistia A; Saiful Bukhori
INFORMAL: Informatics Journal Vol 3 No 1 (2018): INFORMAL - Informatics Journal
Publisher : Faculty of Computer Science, University of Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/isj.v3i1.9852

Abstract

Depth-first search algorithm are blind search process and deepen search follow a single track until found goal. Maze is complicated network way and tortuous, also have many deadlock. Maze often become a challenge in a game like puzzle, which one there’s an object in start position have find way out on specify position. in this journal we’ll discuss about utilization DFS on maze and fastest time to find way out.
Rekomendasi Pemilihan Minat Studi Menggunakan Metode Mamdani Studi Kasus : Program Studi Sistem Informasi FTI UMBY Anief Fauzan Rozi; Agus Sidiq Purnomo
INFORMAL: Informatics Journal Vol 2 No 3 (2017): INFORMAL - Informatics Journal
Publisher : Faculty of Computer Science, University of Jember

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

Abstract

Determination of the concentration / interest of study for most students can’t be applied easily. Most students still do not know exactly what their concentration is. Only for students who are smart in IPK and mature in the pattern of thinking that can determine the concentration of studies easily and not wrong target. Besides still confused and tend to choose the concentration that is not in accordance with the interests and talents of each. Confusion or the majority of students' mistakes to specialization in accordance with the ability due to the number of elective courses offered in line with the interests offered. Based on this problem, it takes a decision making tool or recommendation to the student about the concentration/interest of study whether the most appropriate according to ability. In this research will be made decision support system for recommendation of study by implementing fuzzy inference (mamdani). Where this system will provide information on the interest of the study can be selected based on the value variable. So it can help students in choosing the interests of the study in accordance with the appropriate competence and interest talent. Based on the 20 data that have been tested, obtained 19 data and 1 data that is not appropriate, thus can be calculated the performance of the system that is equal to 95%.
Analisis Perbandingan Fitur Search Engine Saiful i Bukhor
INFORMAL: Informatics Journal Vol 3 No 1 (2018): INFORMAL - Informatics Journal
Publisher : Faculty of Computer Science, University of Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/isj.v3i1.9850

Abstract

Search engines are used in the web as a tool for information retrieval. Web Server is a large warehouse of heterogeneous and unstructured data so that to filter out relevant information from people, a search engine is needed. Search engines usually consist of page repositories, indexing modules, query modules and ranking modules. Search engines do not work alone, besides that there is a web browser that supports the work of this search engine to be more optimal. A browser is software that is run on a user's computer (user) that displays web documents or information taken from a web server [1]. A browser is the type of intermediary the user uses most often. This paper aims to analyze three search engines namely Google, Yahoo, and Bing based on existing features. These features include web search, image search, video search, news search, route search, book search, change search settings, display number of views, shopping, language translator. Google stands as the best search engine among all search engines, which works using the Page Rank algorithm. Page Rank is a numerical value that determines the importance of a web page by calculating the number of backlinks.
Strategi Menemukan Jalan Keluar Labirin dengan Waktu Tercepat Menggunakan Metode DFS Mustika Rahmasuci; Husnul Hotimatus Sahroh; Maulina Azizah; Putri Wulandari; Diah Adistia; Saiful Bukhori
INFORMAL: Informatics Journal Vol 2 No 3 (2017): INFORMAL - Informatics Journal
Publisher : Faculty of Computer Science, University of Jember

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

Abstract

Depth-first search algorithm are blind search process and deepen search follow a single track until found goal. Maze is complicated network way and tortuous, also have many deadlock. Maze often become a challenge in a game like puzzle, which one there’s an object in start position have find way out on specify position. in this journal we’ll discuss about utilization DFS on maze and fastest time to find way out.
Sistem Pendukung Keputusan Seleksi Beasiswa Situbondo Unggul Menggunakan Metode Simple Additive Weighting dan Profile Matching Moh Febri Nurul Qorik; Slamin Slamin; Priza Pandunata
INFORMAL: Informatics Journal Vol 3 No 1 (2018): INFORMAL - Informatics Journal
Publisher : Faculty of Computer Science, University of Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/isj.v3i1.9853

Abstract

This study is about the use of simple additive weighting (SAW) and profile matching methods for the construction of information systems supporting the decision selection of scholarships. The case study of this research is the selection of superior situbondo scholarships in the Education Office of Situbondo Regency. The purpose of this study was to apply the profile matching method and SAW in resolving the problem of selecting the Situbondo Superior Scholarship recipients who had 2 aspects of assessment, namely aspects of poverty and academics which made it difficult to select scholarships, this difficulty is caused by the value of the aspect of poverty must be the smaller the difference in the value of students with the value of the scholarship it will be better while the academic value must go far beyond the minimum value, the better. The profile matching method is used to calculate the value of the aspect of poverty and SAW is used to calculate the value of the academic aspects. To determine the final results of this study using the criteria for decision-making scale determined by the District Education Office of Situbondo, one of the final methods of the method is less than 30 worth not funded, one of the final method values less than 60 is considered to be funded. The development of information systems supporting superior decision making for the Situbondo scholarship using the profile matching and simple additive weighting methods using a website-based system with system design using the SDLC waterfall model, implementation of the system using the laravel framework and program code using the hypertext pre-processor programming language (PHP ), while for managing the database using MySQL DBMS and system testing using black box and white box ( testing unit). The results of this research method of profile matching and simple additive weighting can be applied properly in a superior situbondo scholarship decision support system.
Optimasi Waktu Lampu Pengatur Lalu Lintas Menggunakan Algoritma Genetika di Persimpangan Heru Tri Ahmanto; Joko Lianto Buliali
INFORMAL: Informatics Journal Vol 2 No 3 (2017): INFORMAL - Informatics Journal
Publisher : Faculty of Computer Science, University of Jember

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

Abstract

In the modern era of population growth is increasing, the increase in the number of population then increased also the means of transportation that causes traffic congestion. intersection are the concentration of traffic issues that become one of the main causes of traffic congestion, this is because the intersection is where the migration of cars from one to the other road segments. Traffic lights are the lights used to curb road users crossing a road junction, but most traffic lights do not run optimally, causing traffic congestion. In this study proposed a method of genetic algorithm for optimization of the traffic lights with the aim of getting the model movement of car and get the fitness function model for the optimization of traffic light so as to get traffic lights are optimal on each road segment base on total average number of cars were able to pass through the intersection . Base on scenarios testing 1, produces lights optimal on each road segment, namely roads 1 and roads 3 for 49 seconds for green time, roads 2 and the road 4 for 55 seconds for green time means total average number of cars passing through the intersection of as many as 81 cars and Base on scenarios testing 2, produces lights optimal on each road segment, namely roads 1 and roads 3 for 56 seconds for green time, roads 2 and the road 4 for 54 seconds for green time means total average number of cars passing through the intersection of as many as 95 cars.
REAR COVER Saiful Bukhori
INFORMAL: Informatics Journal Vol 3 No 1 (2018): INFORMAL - Informatics Journal
Publisher : Faculty of Computer Science, University of Jember

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

Abstract

Page 4 of 22 | Total Record : 219