Garuda - Garba Rujukan Digital

ANALISIS KUALITAS LULUSAN BERDASARKAN TINGKAT KEPUASAN PENGGUNA LULUSAN Setyaningsih, Ira; Abrori, Muchammad
Jurnal Ilmiah Teknik Industri Vol. 12, No. 1, Juni 2013
Publisher : Muhammadiyah University Press

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.23917/jiti.v12i1.662

In education, the students are the products to be input and the output are graduates. Users of graduates are consumers who need to know the level of satisfaction to provide a self-evaluation in improving the institutions. It is also stated in the accreditation forms BAN PT. However, a grain questions that sought to know is very little. The research was conducted at a university in Yogyakarta. Research trying to describe in detail the attributes of quality of graduates based on the user satisfaction level graduates. Object of study is alumni and also alumni users. The study was conducted during the months of August to November 2012. Attributes used are Communication Skills, Organizational Skills, Leadership, Logic, Effort, Ethics, Group and Other Skills. Other attributes are attributes about the ability of areas of expertise. From the results obtained, the attributes that need attention are Organizational Skills and Leadership with the highest gap -0.82. Overall, users of alumni do not feel satisfied, because all negative attributes.

PENENTUAN MATCHING MAKSIMUM PADA GRAF BIPARTIT BERBOBOT MENGGUNAKAN METODE HUNGARIAN Abrori, Muchammad; Wahyuningsih, Rina
Jurnal Ilmiah Teknik Industri Vol. 11, No. 1, Juni 2012
Publisher : Muhammadiyah University Press

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.23917/jiti.v11i1.984

Matching is a part of graph theory that discuss to make a pair, that can be used to solve many problems; one of them is the assignment problem. The assignment problem is to make a pair problem for n as the employees and for n as the duties, therefore each employee gets one duty, and each duty is given exactly for each employee. The assignment problem can be solved by determining the matching in weighted bipartite graph through Hungarian Method. It can be determined from the alternating tree of a formed edge. If there is augmenting path, that augmenting path is used to form the more number of matching. If the formed path is alternating path, therefore the process is labeling the new node until finding the augmenting vertices. This matching is called as the perfect matching with the number of maximum weighed side in weighted bipartite graphs. The result matching is the solution for the assignment problem by giving an employee with a duty.

Pemanfaatan Solar Cell Sebagai Sumber Energi Alternatif dan Media Pembelajaran Praktikum Siswa Di Pondok Pesantren “Nurul Iman” Sorogenen Timbulharjo, Sewon, Bantul, Yogyakarta Menuju Pondok Mandiri Energi Muchammad Abrori; Sugiyanto Sugiyanto; Thaqibul Fikri Niyartama
Jurnal Bakti Saintek: Jurnal Pengabdian Masyarakat Bidang Sains dan Teknologi Vol. 1 No. 1 (2017)
Publisher : Fakultas Sains dan Teknologi, UIN Sunan Kalijaga Yogyakarta

Salah satu usaha manusia dalam mengurangi pemanasan global atau penggunaan listrik PLN yang berbahan bakar fosil adalah dengan penggunaan sel surya. Pemasangan sel surya ini efektif karena wilayah Indonesia berada di daerah tropis. Penggunaan sel surya di Pondok Pesantren Nurul Iman sangat membantu karena kebutuhan energi listrik di Pondok Pesantren Nurul Iman sangat besar. Hal ini dapat dihitung dari biaya yang dikeluarkan per bulan oleh Pondok Pesantren Nurul Iman, pada bulan Agustus 2015 sebesar Rp. 1.372.100,-. Dengan audit energi dapat dikurangi beban yang digunakan sebesar 1.250 watt. Kalau penggunaan lampu rata-rata 12 jam listrik dapat dihemat sebesar Rp. 436.271,- per bulan. Penghematan lampu dengan surya sel yang dapat dilakukan sebesar Rp. 77.555,- per bulan. Lebih dari sepertiga yang dapat dikurangi biaya listriknya dengan sel surya.

A Mathematical Model of the Covid-19 Cases in Indonesia (Under and Without Lockdown Enforcement) Sugiyanto Sugiyanto; Muchammad Abrori
Biology, Medicine, & Natural Product Chemistry Vol 9, No 1 (2020)
Publisher : Sunan Kalijaga State Islamic University & Society for Indonesian Biodiversity

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.14421/biomedich.2020.91.15-19

COVID-19 stands for Corona (CO), Virus (VI), Disease (D) and year 2019 (19), which is COVID-19 first appeared in 2019. Mathematical model of covid deployment in Indonesia under and without lockdown case uses the SIRV model, such as Susceptible, Infected, Recovery, and Virus. The results of this model state that under lockdown the spread of COVID-19 could be stopped. If it were not under lockdown it can multiply 1,276 times higher over two months.

ANALISIS KUALITAS LULUSAN BERDASARKAN TINGKAT KEPUASAN PENGGUNA LULUSAN Ira Setyaningsih; Muchammad Abrori
Jurnal Ilmiah Teknik Industri Vol. 12, No. 1, Juni 2013
Publisher : Department of Industrial Engineering Universitas Muhammadiyah Surakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.23917/jiti.v12i1.662

In education, the students are the products to be input and the output are graduates. Users of graduates are consumers who need to know the level of satisfaction to provide a self-evaluation in improving the institutions. It is also stated in the accreditation forms BAN PT. However, a grain questions that sought to know is very little. The research was conducted at a university in Yogyakarta. Research trying to describe in detail the attributes of quality of graduates based on the user satisfaction level graduates. Object of study is alumni and also alumni users. The study was conducted during the months of August to November 2012. Attributes used are Communication Skills, Organizational Skills, Leadership, Logic, Effort, Ethics, Group and Other Skills. Other attributes are attributes about the ability of areas of expertise. From the results obtained, the attributes that need attention are Organizational Skills and Leadership with the highest gap -0.82. Overall, users of alumni do not feel satisfied, because all negative attributes.

PENENTUAN MATCHING MAKSIMUM PADA GRAF BIPARTIT BERBOBOT MENGGUNAKAN METODE HUNGARIAN Muchammad Abrori; Rina Wahyuningsih
Jurnal Ilmiah Teknik Industri Vol. 11, No. 1, Juni 2012
Publisher : Department of Industrial Engineering Universitas Muhammadiyah Surakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.23917/jiti.v11i1.984

Matching is a part of graph theory that discuss to make a pair, that can be used to solve many problems; one of them is the assignment problem. The assignment problem is to make a pair problem for n as the employees and for n as the duties, therefore each employee gets one duty, and each duty is given exactly for each employee. The assignment problem can be solved by determining the matching in weighted bipartite graph through Hungarian Method. It can be determined from the alternating tree of a formed edge. If there is augmenting path, that augmenting path is used to form the more number of matching. If the formed path is alternating path, therefore the process is labeling the new node until finding the augmenting vertices. This matching is called as the perfect matching with the number of maximum weighed side in weighted bipartite graphs. The result matching is the solution for the assignment problem by giving an employee with a duty.

RANCANG BANGUN SISTEM DETEKSI DAGING AYAM BANGKAI MENGGUNAKAN SENSOR WARNA DAN JARINGAN SYARAF TIRUAN Muchammad Abrori; Frida Agung Rakhmadi; Nurochman Nurochman
Jurnal Ilmiah Teknik Industri Vol. 14, No. 1, Juni 2015
Publisher : Department of Industrial Engineering Universitas Muhammadiyah Surakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.23917/jiti.v14i1.628

Telah dibuat sistem deteksi daging ayam bangkai menggunakan sensor warna dan jaringan syaraf tiruan. Tujuan pembuatan sistem ini adalah untuk membantu masyarakat umum dalam mendeteksi daging ayam broiler bangkai. Sistem ini dibuat menggunakan sensor warna. Tahapan penelitian meliputi pembuatan perangkat keras, pembuatan perangkat lunak, dan pengujian sistem. Hasilnya, sistem dapat bekerja dengan baik terutama untuk mendeteksi sampel daging bagian dada, tepong, dan paha.

Metode Akra-Bazzi Sebagai Generalisasi Metode Master Dalam Menyelesaikan Relasi Rekurensi Muchammad Abrori
Jurnal Fourier Vol. 2 No. 2 (2013)
Publisher : Program Studi Matematika Fakultas Sains dan Teknologi UIN Sunan Kalijaga Yogyakarta

Rekurensi relation is an equation that relates the elements of a sequence. One of the benefits of the rekurensi relation can be used to calculate the running time/finish of an algorithm. Some algorithms use approach devide-and-conquer in resolving a problem. Rekurensi relations with the approach of the devide and conquer can be solved by several methods. This research aims to know the Akra-Bazzi Method as an extension Method of the Master. This research began with the dissected the concept pertaining to the Relation Rekurensi, methods for resolving Relationship Rekurensi, and lastly about methods of AkraBazzi. Note that Akra-Bazzi Method can solve a rekurensi devide-and-conquer with shorter calculation.

Pengujian Optimalisasi Jaringan Kabel Fiber Optic Di Universitas Islam Indonesia Menggunakan Minimum Spanning Tree Muchammad Abrori; Najib Ubaidillah
Jurnal Fourier Vol. 3 No. 1 (2014)
Publisher : Program Studi Matematika Fakultas Sains dan Teknologi UIN Sunan Kalijaga Yogyakarta

Universitas Islam Indonesia (UII) intergrated campus computer network built since 1995. Development of UII integrated campus computer network is using a star topology and fiber optic (FO) cable. Considering that the star topology is the topology that requires a lot of wires, this study was conducted to determine and examine how the application of graph on the FO cable network UII integrated campus in order to minimize the cost, because FO cable network can be modeled by a graph where the buildings as points, while FO cable that connects to each building as a line. This type of research that is used here is a case study, in which data collection by observation, interviews, and documentation. This study used 4 algorithms, that is Kruskal algorithm, Prim, Boruvka and Solin algorithm to find the Minimum Spanning Tree. Based on the research that has been done, the conclution about the troubleshooting steps of optimization UII integrated campus FO cable network based graph theory has been got. From the four algorithms obtained the most optimal results FO cable length 4.700 meters long and is 1.590 meters cable lines. While the results of observations made, it is known that the existing computer network in UII integrated campus has a cable length of 6.120 meters and 2.050 meters long track. The results of the analysis showed that the resulrs of the study 23.2% more optimal than the existing computer networks in UII integrated campus.

Implementasi Algoritma Best-First Search (BeFS) pada Penyelesaian Traveling Salesman Problem (TSP) (Studi Kasus: Perjalanan Wisata Di Kota Yogyakarta) Muchammad Abrori; Rike Nur Setiyani
Jurnal Fourier Vol. 4 No. 2 (2015)
Publisher : Program Studi Matematika Fakultas Sains dan Teknologi UIN Sunan Kalijaga Yogyakarta

Yogyakarta offers many tourist attractions, from nature based tourism, culinary tourism until cultural tourism. With so many tourist attractions offered by Yogyakarta, tourist often finds it difficult to arrange their travel schedule (from choosing which tourist attractions to be visited until choosing which route tourist should takes to maximize their vacation time). Therefore, itâ€™s required to have a way to determine the shortest tour route so tourist can make their tour in the Yogyakarta effective. This problem can be categorized as Traveling Salesman Problem (TSP) case. There are a lot of methods can be used to find the shortest route in Travelling Salesman Problems (TSP) case. To solve the problem, which is to find the shortest tour route in Yogyakarta, Algorithm Best-First Travelling will be used in this undergraduate thesis. The implementation of Algorithm Best-First Search to find the shortest tour route in Yogyakarta can be used to produce a solution for tourist to choose the shortest tour package and decide which route they should take. The premium tour package produces tour route from Adi Sucipto Airport-Gembira Loka Zoo- Purawisata-Nâ€™dalem Gamelan Hotel-Yogyakarta Palace-Benteng Vredeburg Museum-Taman Pintar-Tamansari-Adi Sucipto Airport with distance covered 20.297 meter. The middle tour package produces tour route from Tugu railway station-Benteng Vredeburg Museum- Taman Pintar-Yogyakarta Palace-Mawar Asri Hotel-Tamansari-Purawisata-Gembira Loka Zoo-Tugu railway station with distance covered 11.772 meter. The economy tour package produces tour route from Giwangan bus station- Gembira Loka zoo-Purawisata-Yogyakarta Palace-Mitra Hotel-Benteng Vredeburg Museum-Taman Pintar-Tamansari-Giwangan bus station with distance covered 14.037 meter.

Title

Found 30 Documents
Search

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title Search

Found 30 Documents Search

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title

Found 30 Documents
Search