Judul: Aplikasi Mobile Penentuan Rute Terpendek di Kebun Raya Bogor Menggunakan Algoritme Dijkstra
Abstrak: Bogor Botanical Gardens (BBG) has many trees, plant collections, and points of interest which located in a wide area around 87 hectares. In addition, BBG also has a museum building, laboratory, and many important places which give difficulty for a person to reach those location. Because of the distance of each location, navigation or guide becomes essential for travelers who want to looking around BBG with optimum time. These problems can be solved by graph modelling to determine the shortest route from each location using Dijkstra algorithm. Based on the results of comparative testing in applications with spacing distance pedometer difference obtained an average error distance is 65.3 meters, this is because the location coordinate data obtained from different Google Maps with location coordinates of the received GPS signal while in KRB on pedometer application.
Keyword: Bogor Agricultural University (IPB), Dijkstra algorithm, shortest path, graphs, navigation

Judul: Penentuan Jalur Tercepat dan Terpendek Berdasarkan Kondisi Lalu Lintas di Kota Bogor Menggunakan Algoritme Dijkstra dan Algoritme Floyd-Warshall
Abstrak: Bogor is one of the major cities in Indonesia which have congestion problems large enough at some point. The congestion partly caused by the large number of public transport and private vehicles which circulating on the road, both are considered to have exceeded the capacity of the streets of the Bogor city . One alternative that can be offered to deal with this congestion is determine the best path to follow. The best path is the fastest path or the shortest path that used to achieve a place in the Bogor city in accordance with the conditions of the road traffic density. Dijkstra algorithm and Floyd algorithm Warshal as shortest path algorithm which is excellent in providing optimum value is used to support the of the best path with the most optimal travel time. The research resulted in a system that is able to produce the fastest path and the shortest path along with the approximate distance, estimated travel time and time of arrival. The function to determine the fastest path is capable of generating the fastest path adjusted to the results of the displacement time. Hence, the system always provide the path with the most optimal travel time.
Keyword: 

Judul: Karakteristik Carboxymethyl Chitosan Dengan Variasi Konsentrasi NaOH
Abstrak: Carboxymethyl chitosan is chitosan derivative product obtained from chemical modification. CMCh were made by alkalization process and carboxymethylation process. Factors that affect CMCh characteristics were excess sodium hydroxide in alkalization process, ratio between chitosan and monochloroacetic acid, and carboxymethylation temperature. The objectives of this research were to study the NaOH effect to CMCh characteristics, to learn process of making CMCh, to set the proper concentration of NaOH, and to analyze CMCh characteristics. CMCh yields were 110.72%-114.22%. CMCh pH value were 3.74-4.31. The optimum NaOH concentration to obtain the best CHCh was 10 M. Percentage of CMCh moisture content was 10.70%-11.42%. Ash content and nitrogen content of CMCh were 0.49%-0.50% and 4.52%-4.81%. CMCh viscousity was 8.25 cps. Percentage of CMCh solubility was 61.61%-91.50%. The different functional groups from chitosan which observed in CMCh were C=O group, CH group from alkene functional group, C−O group, and C−O−C group.
Keyword: solubility., functional group, CMCh characteristics, chitosan, carboxymethyl chitosan