Judul: Captive Breeding Management and Daily Activity of Green Peafowl in Bird Park Taman Mini Indonesia Indah
Abstrak: Merak hijau adalah jenis burung dari golongan famili Phasianidae yang tersebar di sepanjang Pulau Jawa dan mendapatkan prioritas sangat tinggi untuk ditingkatkan populasinya, seperti yang dilakukan di Taman Burung Taman Mini Indonesia Indah Jakarta sebagai lembaga konservasi eksitu. Tujuan penelitian adalah mengidentifikasi manajemen pemeliharaan merak hijau dan mendeskripsikan perilaku harian merak hijau. Data dikumpulkan dengan cara observasi lapang, pengukuran, dan wawancara. Hasil penelitian menunjukkan manajemen pemeliharaan dilakukan secara intensif yang artinya pengelola mengatur semua aspek manajemen. Terdapat 9 jenis perilaku harian yang teramati, didominasi oleh perilaku memelihara tubuh dengan frekuensi 29% dan durasi 31% dari total waktu pengamatan. Tidak terdapat perbedaan yang signifikan antara perilaku merak hijau jantan dan merak hijau betina, begitu pula dengan perilaku merak hijau yang ada di kandang dan merak hijau yang dilepas di Taman Burung Taman Mini Indonesia Indah Jakarta., Green peafowl is one of the biggest Phasianidae bird that spread in Java Island. Green peafowl has high priority to increase the population by the government, which through ex-situ conservation in captive breeding. This research aims to identify captivity management and to describe daily activities of green peafowl in Bird Park Taman Mini Indonesia Indah. The data were collected by observating, measuring, and interviewing manager and animal keeper. The results of this study showed that Green peafowl in Bird Park Taman Mini Indonesia Indah managed intensively, which means holder manages all the aspects of management. Components that provides green peafowl’s life in cage were made as close as natural habitat of green peafowl. Green peafowl has 9 daily activities which dominated by body caring which has total frequency is 29% and total duration is 31% of all activities. Green peafowl in order to fulfill daily energy needs are doing ingestive activity that has frequency 16% and duration 17%. Generally, there is no significant difference between male and female green peafowl activity, likewise between in caged and released green peafowl activity.
Keyword: Captive Breeding, Daily Activity, Green Peafowl

Judul: Ekologi merak hijau jawa (pavo muticus muticus) linnaeus 1758 pada beberapa tipe habitat di Ujung Timur Penyebarannya, Jawa Timur, Indonesia
Abstrak: The javan green peafowl status is protected bird in Indonesia base on SK Mentan No 66/Kpts/Um/2/1973 and Republic of Indonesia Regulation Law No 7 year 1999. According to ICBP (The International Council for Bird Preservation) has stated that the green peafowl as globally threatened bird in both population and their habitat. Meanwhile CITES has recorded at Appendix II and International of BirdLife (2007) has categorized as endangered bird Pressure to the population and habitat of javan green peafowl is quite big, so the populations have small size at every local site on their local distribution, habitat became fragmented event isolated. Pressure to population is caused by the poaching. But fact showed that javan green peafowl still exist in wild, so the phenomenon gave illustration that the bird have ecological strategy to adapt with the pressure at several habitat type. Ecology of the javan green peafowl (Pavo muticus muticus) Linnaeus 1758 at several habitat types eastern tip of their distribution in Alas Purwo and Baluran national park is the topic to analysis and synthesis of the ecological strategy adaptation at case several habitat types in both national park which the eastern tip of the javan green peafowl distribution. Observation of the javan green peafowl ecology at several habitat types eastern tip of their distribution conducted in three year (year 2006, 2007 and 2008) but intensively 10 month in Baluran national park (BNP) and Alas Purwo national park (APNP) The observation focused at several habitat types at savanna, monsoon forest and evergreen forest also beach forest of Bekol resort BNP and beach forest, grazing area, intercropping teak plantation forest and teak plantation forest Rowobendo resort APNP. The observation has been done at main plot with size 3 km X 4 km in resort Bekol BNP and in resort Rowobendo APNP. Observation of population and habitat of the javan green peafowl was focused at those habitat types. The javan green peafowl population was observed by call count transect method and concentration count and was analyzed on demographic population parameter such as number individual male and female bird, sex ratio, age structure, natality, mortality, survival and population growth at several habitat types. The javan green peafowl habitats were observed and analyzed the characteristic of feeding site and food species, drinking site, sunning and preening place, sheltering and resting site, covering site, roosting site, dancing place and nesting site at several habitat types. Besides that analysis, determinant habitat factors were analyzed by principle component analysis and habitat ideal for the javan green peafowl. Behavior ecology which has been observed and analyzed was the activities, mechanism and strategy of the javan green peafowl in group on feeding, drinking, sunning, sheltering and resting, covering, dusting, dancing, mating, fighting and calling behavior ecology in relation to the habitat types. The result showed that population size of the javan green peafowl at every habitat type in Baluran and Alas Purwo national park is small 24 – 44 individual. The biggest population abundance of the javan green peafowl at Baluran is at savanna habitat type, but in Alas Purwo more concentrated at
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: