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 Lokasi Ideal Berdasarkan Total Jarak Tempuh Terpendek dari Berbagai Lokasi Menggunakan Algoritme Dijkstra
Abstrak: Finding shortest path is a method to maximize time efficiency to travel from one place to another. A good location is a place with minimum path from locations where it is accessed. A good location is considered to be potential for public facility, housing complex, etc. In this research, graph theory is used to solve the problem of deciding location with minimum path from accessing locations. Mapping of a region is represented as a graph with location points and accessing locations as nodes and variation paths as arcs. The next step is finding the shortest path for every location candidate nodes from accessing nodes using Dijkstra algorithm. This research resulted in a web based aplication that presents a territory map and a user can choose where the location candidates and accessing locations are. The user will be shown the best location out of location candidates.
Keyword: Bogor Agricultural University (IPB), shortest path, region mapping, graph, Dijkstra algorithm

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