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: Pengelolaan penangkaran buaya di CV Surya Raya Balikpapan, Kalimantan Timur
Abstrak: CV Surya Raya is one of captive crocodiles in East Kalimantan. This captivity is not only breed comercial crocodiles such as estuarine crocodiles (Crocodylus porosus) for their skin and meat, but also breed siamese crocodiles (Crocodylus siamensis) and false gharial (Tomistoma schlegelii). Those two species are endangered extinct national and internationally. The limited information and management techniques of crocodiles so that this research needs to be done. This research aims are to identified management techniques of captive crococodiles in CV Surya Raya and to analysis succesful indicators of captive crococodiles in CV Surya Raya. The research has been held in June to October 2010. The data collected are aspects of management techniques of captive crocodiles in CV Surya Raya. Data were collected through observation, interview, and literature studies. Analysis data are using descriptive and quantitative analysis to the percentage of egg hatchability. The management crocodiles in captivity CV Surya Raya consists of five main activities such as caging management, feeding management, diseases and keeping healthy, reproduction management, and production usage management. Management techniques on captive breeding include in intensive management category. Based on reproduction and socio economics aspects this captive for estuarine crocodiles and siamese crocodiles was success, but for false gharial not too succesful. Factors that are influence reproduction aspect such as selection of seedling, sex ratio in each cage, cage location and breeding equipment, and technology hatching. An aspect social economics of society around captivity is influence by their participation on management activity.
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: