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: Synthesis of Apatite - Chitosan Composite Using Duck Eggshell and Chitosan with Temperature and pH Control
Abstrak: Composite of apatite-chitosan was prepared by using chitosan as polymer matrix. Calcium phosphate was prepared from CaO and (NH4)2HPO4, which the ratio Ca : P had to be 1.67. Chitosan is produced by deacetilase from biopolymer chitin. Duck eggshell (95% CaCO3) as starting material was converted to be calcium oxide (CaO) through calcinations with temperature 1000oC for 5 hours. In-situ and ex-situ methods were prepared from apatite and chitosan (dissolved with acetate acid 2%). Calcium phosphate prepared for bone implantation, but it is too fragile and brittle to be implant into the body. So addition of chitosan can decrease crystalinity and increase mechanic characteristic (tougher). Composite apatite-chitosan was resulted by fast precipitation. Fast precipitation was held in a breaker glass with nitrogen atmosphere, under controlled temperature at 37oC and pH 7, in order to increase amount of hydroxyapatite. Precipitation with CaO which was dropped by (NH4)2HPO4. Hydroxyapatite and chitosan were appearing at samples with in-situ and ex-situ methods which indicating by peak matching of XRD (closed lattice parameter, crystal size), overlapping at FTIR spectra and supporting by SEM picture (homogenous and agglomerated particle). However, it still needs further research to examine biocompatibility osteoconductive degree of sample by in-vivo and in-vitro test.
Keyword: