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: 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: Enrichment of organic selenium, inorganic selenium and  vitamin E in quail products through its supplementation in the diet and its potency  of quail eggs as an ingredient in selenium-rich egg juice
Abstrak: This study was aimed to achieve an optimum level of combine organic selenium, inorganic selenium and vitamin E in obtaining the best production and reproduction as well as the highest level of selenium in quail eggs. This study was conducted from January to August 2008. Numbers of observed quails were 720 (360 females and 360 males). The treatments were applied when the quails were six weeks old. Nine treatment diets were: To (commercial diet), T1(0.46 ppm inorganic Se + 43.50 ppm vitamin E), T2 (0.46 ppm inorganic Se + 87.00 ppm vitamin E), T3 (0.92 ppm inorganic Se + 43.50 ppm vitamin E), T4 (0.92 ppm inorganic Se +87.00 ppm vitamin E), T5 (0.46 ppm organic Se + 43.50 ppm vitamin E), T6 (0.46 ppm organic Se + 87.00 ppm vitamin E), T7(0.92 ppm organic Se + 43.50 vitamin E) and T8(0.92 ppm organic Se + 87.00 ppm vitamin E).
Keyword: egg yolk, glutathione peroxidase ( GSH-Px), hedonic test, rank test