Judul: Teknik penangkaran buaya muara (Crocodylus porosus) di penangkaran Taman Buaya Indonesia Jaya, Serang, Bekasi, Jawa Barat
Abstrak: Taman Buaya Indonesia Jaya is one of the captive crocodiles in Bekasi, Jawa Barat. This captivity is not only breed commercial crocodiles such as estuarine crocodiles (Crocodylus porosus) for their skin and meat, but also breed siamese crocodiles (Crocodylus siamensis) and false gharial (Tomistoma schlegelli). Those two species are endangered extinct national and internationally. This research was aimed to study captive breeding techniques and identify measures of success Crocodylus porosus in Taman Buaya Indonesia Jaya. The research was conducted in Taman Buaya Indonesia Jaya on February until October 2012. Instrument used include digital camera, stationery, tally sheet, meter, litmus, interview guide, dry and wet thermometer and object of the research was Crocodylus porosus and manager from Taman Buaya Indonesia Jaya. The data of captive breeding techniques was analyzed descriptive, measures of success Crocodylus porosus from Taman Buaya Indonesia Jaya were quantitative analysis. Captive breeding techniques of Crocodylus porosus in Taman Buaya Indonesia Jaya consists of five main activities such as caging, feeding, diseases and keeping healthy, reproduction and production usage. Techniques on captive breeding include in intensive management category. Activity of captive breeding from Taman Buaya Indonesia Jaya can be categorized success were reproduction rate (50,32%), moderate egg hatching rate (42,32%) and low mortality (27,35%). An aspect social economics of society around captivity is influence by their participation on management activity
Keyword: 

Judul: Keberhasilan Penangkaran Buaya Muara Crocodylus Porosus Schneider, 1801 Dengan Pola Pembesaran: Studi Kasus Penangkaran Buaya Di Provinsi Papua
Abstrak: Estuarine crocodile in Indonesia was included in the category of Appendix II of CITES, thus its utilization and trade must be as speciments from captive units. Captive with ranching scheme was allowed only in Papua province and had occured for ± 15 years. Unfortunately, the recent condition showed a decreasing of ranching units and the number of crocodiles ranched. These can become a threat to the wild population in form of direct harvesting from the crocodile’s natural habitat. Technical activity was needed to assure that the ranching products was adequate in term of enlargement period and economic cutting size, of which the data was not yet available. This research was aimed to (1) describe the mastery of knowledge and technology practice within the management of estuarine crocodile at a captive unit, (2) measure the success rat of the captive and (3) identify the support from stakeholders for the success and sustainability of this ranching scheme captivity. The research took place in February – July 2012 at CV. Bintang Mas in Jayapura. The methods used for collecting data were observation, interview and literature study, also using descriptive analysis to analyze the data. The result showed that the knowledge mastery was at medium rate, though technically the captive unit were able to apply most of captive main activities. Mortality rate of juveniles during the enlargement period (4-5 years) was at the medium level (10-30%). The limitating factor for developing the captive unit was the human resource which was not yet reconciled with the availability of infrastucture. Success index assessment within the biology and technical criteria resulted a number of 0.622 which suggested that this captive unit had a fine category (62.2%), and was considered succesful and be allowed to utilize its product. As to increase the success and sustainability of estuarine crocodile captive unit with ranching scheme, the support from stakeholders in form of actions (cooperation, knowledge enhancement and conservation awareness) and expectation towards the improvement of management form and sustainable use were definitely needed.
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: