Judul: Pengelolaan sumberdaya udang mantis (harpiosquilla raphidea Fabricius, 1798) berdasarkan informasi biologi di Kuala Tungkal, Kabupaten Tanjung Jabung Barat, Jambi
Abstrak: This study aims to assess the distribution of population structure, growth, potential food sources, and exploitation rate of mantis shrimp (Harpiosquilla raphidea Fabricius, 1798) as the initial and the basis information for sustainable management of mantis shrimp. This research was conducted in Kuala Tungkal, Tanjung Jabung Barat, Jambi and Chemistry Department, Faculty of Science, University of the Ryukyus, Okinawa, Japan from July 2009 to December 2010 and partially carried out periodically. The results showed the difference in group size distribution is quite clear between the mantis shrimp are caught in the intertidal and subtidal areas. Mantis shrimps in the intertidal area were in the range of 25-233 mm length is dominated by the size of 79-96 mm, while the mantis shrimp in the subtidal area in the range of 160-366 mm length which is dominated by the mantis shrimp the size of 193-258 mm. Growth coefficient (K) H. raphidea is 0.14 for males and 0.11 for females; and L∞ is 381.68 mm (same for males and females). The value of K H. raphidea is same relatively with some other mantis shrimp species, such as Squilla mantis, Oratosquilla oratoria, and O. stephensoni, but H. raphidea have a longer life span, which is 6.7 to 8.5 years. The value of exploitation rate (E) H. raphidea is 0.42; showed that the exploitation rate of mantis shrimp in Kuala Tungkal, Jambi, is not optimum yet. Stable isotope analysis results indicated that the potential food source for shrimp mantis H. raphidea, especially in the intertidal area, is the group of deposit feeders, filter feeders, and plankton. Alternative resource management for mantis shrimp in Kuala Tungkal is habitat protection and domestication of mantis shrimp.
Keyword: 

Judul: Biologi Reproduksi Udang Mantis Harpiosquilla raphidea di Perairan Kuala Tungkal, Tanjung Jabung Barat, Jambi
Abstrak: Udang mantis Harpiosquilla raphidea merupakan salah satu jenis komoditi perikanan yang menjadi andalan di beberapa daerah, salah satunya Kuala Tungkal, Tanjung Jabung Barat, Jambi. Penelitian ini bertujuan mengkaji beberapa aspek biologi reproduksi udang mantis, meliputi hubungan panjang-bobot, morfologi organ reproduksi, rasio kelamin, tingkat kematangan gonad, ukuran pertama kali matang gonad, dan indeks kematangan gonad. Pengambilan udang contoh dilakukan pada tanggal 19-23 Juni 2010 di perairan pantai berlumpur Kuala Tungkal, Tanjung Jabung Barat, Jambi dengan metode purposive sampling dengan membagi lokasi menjadi 3 stasiun yang ditentukan berdasarkan tingkat intensitas penangkapan udang mantis. Alat kelamin jantan yang disebut petasma (penis) terletak pada pangkal kaki jalan (pereiopod) ketiga berbentuk tonjolan kecil memanjang dan terdapat di kedua sisi kaki jalan, sedangkan alat kelamin betina (thelicum) terletak pada pertengahan kaki jalan pertama berbentuk datar. Hasil analisis uji-t menunjukkan udang mantis H. raphidea di Kuala Tungkal memiliki pola pertumbuhan isometrik. Rasio kelamin menunjukkan perbandingan jantan:betina sebesar 1:1,3 (lapang) dan 1:1,1 (penampungan). Pengamatan tingkat kematangan gonad (TKG) menunjukkan pada udang mantis jantan TKG I memiliki persentase yang besar dibanding TKG II, dan III, sedangkan pada udang mantis betina TKG I juga mendominasi penyebaran TKG namun persentasenya tidak sebesar pada udang mantis jantan.
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: