Judul: Aspek Reproduksi Undur-undur Laut Hippa adactyla (Fabricius: 1787) di Pantai Berpasir, Kabupaten Cilacap.
Abstrak: Mole crab (Hippa adactyla) is a crab species from ordo Decapoda. It lives on sand coastal water sediment that affect by high and low tide. Mole crab also considered as one of important economic species. The aim of this research is to analyze egg productivity, egg diameter, egg volume and production energy of mole crab H. adactyla on sandy beach, Cilacap. The research was conducted from January to December 2013 on sandy beach, Cilacap. The total egg number of H. adactyla is 3 200±2 993 eggs. The average of egg diameter is 0,4409±0,0698 mm and the average of volume is 0,0455±0,0205 mm3. Eggs production by H. adactyla has high correlation with carapace length. The production energy in the form of female dry weight reduction is 0,04%.
Keyword: Egg diameter, egg production, egg volume, Hippa adactyla reproduction energy

Judul: Analisis Populasi Undur-Undur Laut Hippa adactyla Fabricius, 1787 (Crustacean: Hippidae) Berdasarkan Pendekatan Morfometrik dan Genetik di Pantai Berpasir Cilacap dan Kebumen
Abstrak: Mole crab (Hippa adactyla) lives in the intertidal zone of sandy beach ecosystems. Mole crab usually burries into substrate to cope with environmental stress. Indonesian coastal waters is one of the mole crab distribution area, especially families Hippidae, such as in the south coast of Central Java, especially in Cilacap and Kebumen sandy beach. Cilacap and Kebumen communities utilizing mole crab as bait fishing and food ingredients such as ‘rempeyek’. The samples was carried out on August 2014 at intertidal zone of Adipala sandy beach in Cilacap district and intertidal zone of Buluspesantren sandy beach in Kebumen district. Samples were caught using traditional fishing gear called ‘sorok’ along 3 km (1.5 km with one repetition). Total Hippa adactyla were 118 individuals which caught in Cilacap that consisted of 27 males (23%) and 91 females (77%); while 102 individuals that were caught in Kebumen consisted of 46 males (45%) and 56 females (55%). Carapace length to width ratio is above 1 in both population, it shows that the locomotion of H. adactyla is dominant in the vertical direction (backward locomotion). There were eight morphometric characters ratio that can be used as major factors to identify both populations based on discriminant analysis such as total length:carapace length (TL:CL), carapace width:carapace length (CW:CL), left and right coxa length:carapace length (LCo/RCo:CL), left merus length:carapace length (LM:CL), left and right propodus length:carapace length (LP/RP:CL), and left dactylus length:carapace length (LD:CL). Group centroid of morphometric characters in Cilacap (1.042) were separate to group centroid of morphometric characters in Kebumen (-1.205). 16S rRNA gene amplification of eight H. adactyla DNA by PCR machine at 450C annealing temperature. Composition of the nucleotide mtDNA 16S rRNA gene of H. adactyla shows rich of adenine (A) and thymine (T) (A-T rich). There are 54 mutations in the 16S rRNA gene between H. adactyla from Cilacap and Kebumen compared with H. adactyla (KF051307.1) from outside of Indonesia, consists of three sites of insertion, two sites of deletion, twenty nine sites of transition, and twenty sites of transversion. There are 26 specific sites on H. adactyla from Cilacap and Kebumen compared with H. adactyla from outside of Indonesia and Emerita talpoida (KF182557.1) data from GenBank. There is no genetic distance between species H. adactyla from Cilacap dan Kebumen that indicates there are estimated one population. Current pattern in Cilacap and Kebumen are important role in connectivity between H. adactyla from Cilacap and Kebumen.
Keyword: H. adactyla, discriminant analysis, 16S rRNA, Cilacap, Kebumen

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: