Judul: Ekologi Peneluran dan Intensitas Pemanfaatan Labi-labi Moncong Babi (Carettochelys insculpta Ramsay 1886) Di Sungai Vriendschap Kabupaten Asmat, Papua
Abstrak: Carettochelys insculpta (pig-nosed turtle) is one of the soft shelled turtle of southern Papua. Land clearing for human development and high hunting of natural resource affect the condition of forest ecosystems and put pressure on pig-nosed turtle population, while the scientific information in Indonesia is still lacking. In effort to obtain information of pig-nosed turtle in Indonesia, the study was conducted to determine the nesting ecology and intensity utilization of pig-nosed turtle in Vriendschap River Asmat Regency, Papua. Survey was carried out in 8 – 25 November 2011 during nesting season. Transect methods were used to get data on nesting ecology, while unstructured interview and observation techniques be used to assess the intensity of pig-nosed turtle utilization by communities living around the Vriendschap River, Asmat regency, Papua. Results showed that distribution pattern of nests and tracks in Vriendschap River region is clumped with most nesting sites located in Obokain area (the middle of the Vriendschap River). High density of nests were built near vegetation cover compared to area without vegetation. Females prefer sands with the presence of vegetation cover for nesting habitat. The intensity of utilization is very high for eggs (> 75%), whereas females turtles were captured only local consumption. Egg harvesting is done for the whole nest without exception and females turtles were captured simultaneously while collecting eggs.
Keyword: 

Judul: Conservation of The Asiatic Soft-Shell Turtle Amyda cartilaginea (Boddaert, 1770) in The Belawa Village, Lemah Abang District, Cirebon, West Java
Abstrak: Asian soft-shell turtle (Amyda cartilaginea Boddaert,1770) has been considered as sacred turtle by the community of Belawa Village. In the village, they are found in the irrigation channels and fish ponds, as well as in special holding ponds in Cikuya recreation area built by the community. In 2010 a disease outbreak caused by bacteria had caused mass deaths of turtles in the holding ponds. Two years has passed since the outbreaks, and the number of the survived A. cartilaginea is not known. This study aimed to obtain data on recent population of A. cartilaginea, activity patterns and time allocation and management efforts and public perception of the existence A. cartilaginea in the Belawa Village. The study was conducted on March-May 2012, by inventory of turtles population occuring in water bodies in the village. Management efforts and public perception information was obtained by interview and questionnaires. Result of census found 177 A. cartilaginea in Belawa Village mostly concentrated at the holding pond at Cikuya recreation area with a complete structure of the hatchlings, adolescents, young adults and adults. Sex ratio of adults was 1:2,22 and young adults was 1:0,67. A. cartilaginea is usually stay inside mud in the mud and rest at night until noon and will actively breathe and swim in the afternoon. They allocated more time to stay in the mud as much as 54.196%. Missmanagement of A. cartilaginea by holding almost all population in the community’s pond has threathened the population of A. cartilaginea in Belawa Village. Fortunately, the people of Belawa Village have positive perception that A. cartilaginea is a sacred animal and know that is existence in an alarming situation.
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: