Judul: Studi habitat surili (Presbytis aygula Linneaus, 1758) dan pola penggunaannya di taman nasional gunung gede-Pangrango dan kawasan hutan haurbentes Jasinga
Abstrak: Penelitian ini bertujuan untuk: (1) mengetahui kondisi habitat surili di Gunung Gede-Pangrango dan Haurbentes, yang meliputi komposisi, struktur, dan keanekaragaman species vegetasi, pola penyebaran dan kelimpahan pakan, potensi dan penyebaran pohon tempat tidur, dan arsitektur hutan di wilayah jelajah surili; (2) mengetahui bagaimana surili memanfaatkan sumberdaya di habitatnya menurut ruang dan waktu dalam mendapatkan pakan, lokasi/pohon tempat tidur, pergerakan harian, dan perlindungan; serta (3) mengetahui sejauh mana perbedaan adaptasi surili di Gunung Gede- Pangrango dan Haurbentes. Penelitian meliputi pengamatan-pengamatan terhadap karak- teristik dan potensi habitat surili yang meliputi struktur dan komposisi vegetasi, penutupan tajuk dan stratifikasi vertikal tegakan di dalam wilayah jelajah, species dan bentuk pakan (pucuk, daun muda, bunga, dan lain-lain), kadar gizi, serta penyebaran dan kelimpahannya, karakteristik pohon tempat tidur serta potensi dan kelimpahannya, dan kerusakan habitat serta ancaman terhadap kelangsungan hidup surili. Untuk mengetahui pola penggunaan habitat dilakukan pengamatan terhadap pola perilaku/aktivitas yang meliputi aktivitas makan, berpindah, istirahat, vokalisasi, dan aktivitas mengawasi sekitar.
Keyword: 

Judul: Pendugaan Parameter Demografi dan Pola Penggunaan Ruang Surili (Presbytis comata) di Taman Nasional Gunung Ciremai
Abstrak: Surili is an endemic primates of West Java. Its status is protected species based on PP. 7 of 1999, endangered species (IUCN) as well as classified in to Appendix II category, CITES. Data about demography parameter and use space pattern of Surili in Ciremai Mount National Park is necessary as one of the basic case in area management, including for species management, habitat development, drafting or revision zoning and the national park management plan. The research aimed to observation estimate of demography parameter of Surili in Ciremai Mount National Park Area which includes population size, natality, mortality, sex ratio and age composition and to identify use spatial pattern of surili there. Research was conducted at the Ciremai Mount National Park area for five months from Oktober 2012 to Februari 2013. As many as 28 observation points of demography parameter, and 4 points observation of its daily use space pattern. Data of demography parameter taken by concentration count method and data of use spatial pattern taken by focal animal sampling method. Total number of individuals from 28 points observation as many as 164 individuals, with the distribution of 48 individuals in the lowland forest with an average group size (8.00 ± 4.50), 56 individuals in the sub-montane forest with an average group size (5.6 ± 2.49) and 60 individuals in the mountain forest with an average group size (5.00 ± 2.07). Sex ratio total at 28 observation points was 1 : 2, with annual age (Adult : Adult Hood : Kid) 7 : 10 : 11. Value of total natality at 28 observation points was 0.125, with highest mortality value from adult hood to adult was 0,34 . Average of Surili daily cruising area in block Haurcucuk (representative type of lowland forest) was 1.13 ha, with an average daily track length of 516.80 m. Block Kalawija and Saninten (representative type of sub-montane forest), their average daily ranges in series were 2.08 ha and 3.32 ha, with an average daily track length of 935.25 m and 1092.29 m. Next on the block Cigowong (representative type of mountain forests), its average daily cruising area was 5.48 ha, with average daily track length was 1188,3m.
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: