Judul: Perilaku Anak Orangutan (Pongo pygmaeus pygmaeus) di Pusat Primata Schmutzer, Taman Margasatwa Ragunan dan Taman Safari Indonesia
Abstrak: aaaaaOne of the important component in infant development of the orangutan is the parent. In the exsitu habitat, some evidences of infants have been rejected by their parents were identified. The problem arousing from this condition was how to take care of orphan orangutan infants that are refused by their parents or the disability of parents in taking care of their infants. The aim of the research was to determine the difference of behavior development between infants nursed by their parents and those nursed by people. The research has been conducted at the Schmutzer Primate Center (PPS), Ragunan Zoological Park, Jakarta and Indonesia Safari Park (TSI), Bogor, from September 2007 to April 2008. The objects of the research were eight orangutan infants from Kalimantan (Pongo pygmaeus pygmaeus); their age were 1 month, 6 months, 1 year, and 2 years old. Focal animal and ad libitum sampling methods were used on the research. The observation was done on the development of orangutan infant behavior which based on resting, moving, feeding, playing, social, agonistic, and self care. Results indicated that based on the activity pattern, only Chelin (PPS3) and Kano (PPS4) were correspond to general activity pattern in natural habitat. Behavior development of moving and playing increased as orangutan infants grew up. Feeding behavior development did not show neither increase or decrease. However, social behaviour development decreased as they grew up. These findings indicated that the behavior development of moving and playing of orangutan infants in PPS nursed by their parents is better than those nursed by people, while, the development of social and feeding behavior of infants in PPS nursed by people is better than those nursed by their parents.
Keyword: 

Judul: Evaluasi Perubahan Pola Perilaku Makan Pada Orangutan (Pongo pygmaeus morio) Di Pusat Reintroduksi Orangutan Borneo Orangutan Survival (BOS) Wanariset-Samboja Kutai Kartanegara, Kalimantan Timur
Abstrak: Orangutans (Pongo pygmaeus morio) is well known as Indonesian endemic primates that is in endangered status. Borneo Orangutan Survival (BOS) Wanariset obtained reintroduction programs to preserves them from extinction threats. The reintroductions it selfmeans "to release an ex-captive orangutans in adaptable environment", which is needs a rehabilitation process since ex-captive orangutans lost their nature behavior. This study describes and evaluate the pattern exchange of feeding behavior on ex-captive orangutans. The study was done using four rehabilitant orangutans from socialization cages ZZZ (sos-ZZll) and half-way house site (HWH) at BOS Wanariset. Ad libitum sampling methods and focal animal sampling was applied as the observation methods. Each orangutan was observed for ZO days as long as their diurnal activities pattern (an exception for sos-ZZZ orangutans, observation began at 07.00 until 16.00). There were three main activities to observe: food sources, feeding activiry duration and ratio of feeding activity and movement Cfeeding index). This study shown us that the pattern exchange of feeding behavior might be exist on ex-captive orangutans. The lower value of feeding index averages on ex-captive orangutans than wild orangutans (sos-ZZZ = 1.8, HWH = 2.3 Wild = 3.79) and the "A" form curves of sos-ZZZ orangutans time proportion indicates the pattern exchange of feeding behavior. Those d~jJerences might be caused by the sos-ZZZ environment and food sources. The HWH orangutans are fruits, barks, leaves, leave shoots, roots, insects and even soil but not for sos-III orangutans.
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: