Judul: Analisis Risiko Penjualan Pada Usaha Reptil Di Kota Jakarta (Studi Kasus, Savera Reptile Jakarta)
Abstrak: The problems faced by Savera Reptile is sales fluctuation of reptile that tend to fluctuate. This research aims to identify the risk of sales, analyzing risk status, and formulates an alternative treatment that can be used in order to overcome price risk animals of reptiles. This research use several method such as risk mapping, descriptive analyze, z-score, and Value at Risk. Sales risk source that happened in Savera Reptile due to high product was lack of selling and high mortality rates, this was due to product quality, market competition, disease, food availability, and the community’s purchasing power. The biggest risk source challenge is market competition while the lowest is the food availability. The handling alternative which can reduce of risk occurence are prevention and mitigation.
Keyword: Bogor Agricultural University (IPB), Sales Fluctuation, Sales risk, Reptiles Busines

Judul: Pemanfaatan Reptil Sebagai Obat dan Makanan di Daerah Khusus Ibu Kota (DKI) Jakarta
Abstrak: Economic crisis in Indonesia urge people to utilize natural resources including reptile. Reptile used to be regarded as adverse thing, now becoming profitable comodity for medicine and food. Nowadays, demand for reptile is increasing so that creates more risk for sustainability of reptile because most of reptile hunted from wild. The aim of this research was to know the characteristic of reptile traders and consumers, to know the utilization of reptile as medicine and food products and to investigate reptile trafficking in DKI Jakarta. This research was carried out from November until Desember 2008 in DKI Jakarta. The direct observation and interview to the traders and consumers were be used to collect data. There were ten traders selected by purposive sampling method. Whereas 30 consumers were selected based on the average of daily visitors. Most of traders were Indonesian male with average age of 43 years old and having selling experience for 2-43 years. Most of consumer were Indonesian male with the average of age 34 years old. Their education background were senior high school. There were 13 species (southern Indonesian spitting cobra, king cobra, reticulated python, copperhead racer, mangrove snake, banded krait, Malayan krait, ground pit viper, Indian rat snake, asian water monitor, tockay, skink and southest asian softshell turtle) of reptiles that be used as medicine product (fresh blood, salve, capsule, cream, oil, dried gall bladder, dried male genital and powder). There were 7 species (southern indonesian spitting cobra, reticulated python, crocodile, asian water monitor, tockay, skink and southest asian softshell turtle) were used for food products (roasted meat, soup, frieds meat and fried meat powder). Reptile trafficking in DKI Jakarta was divided into 2 networking system, which are: 1) small scale trader (wild reptiles- hunters - primary collectors - secondary collectors - small scale traders - consumer) and 2) large scale trader (wild reptiles - hunters - primary collectors – small scale productions - large scale traders - consumers). People usually utilize reptile for treating skin diseases. It is necessary to control reptile hunting in order to prevent those species from extinction. Breeding in captivity is on off alternatives to reduce hunting of reptile from the wild. Formal monitoring and regulation in reptile utilization by BKSDA DKI Jakarta, monitoring and contolling by BPOM DKI Jakarta as well as research on bioactive content in reptile meat
Keyword: 

Judul: Construction of Strongly Optimal Binary Linear Code with Minimum Distance 9 and 11
Abstrak: A binary linear code of length n over q F is a subspace of n q F . A code has three parameters that attached to it, namely length, dimension, and minimum distance. A code with length n, dimension k and minimum distance d is often called [n, k, d ]-code. Usually, when two parameters are given, then we want to find a code that has the best value for the last parameter. Based on Gilbert- Varshamov bound, if a [n, k, d ]-code exists and can not be expanded, we call it a strongly optimal code. In this paper, we construct strongly optimal code with minimum distance 9 and 11. In constructing the code, we created a theorem and algorithm based on Gilbert-Varshamov bound before we implement the algorithm to MAPLE programming language. Because of computational limitations, the program can only construct up to k = 10 for d = 9 and k = 12 for d = 11.
Keyword: