Judul: Inventarisasi dan Identifikasi Tungau Ektoparasit pada Cicak di Perumahan dan Pasar Kota Tangerang
Abstrak: Every organism interacts with each other such as parasitic mites often find in the gecko (Family: Gekkonidae). Ectoparasite mites can spread in the geckos through sexsual contact and other physical interactions among the geckos.This research were aimed to invent, identify and explore the differences in infestation intensity of ectoparasite mites in gecko collected from the residential and traditional market in the Tangerang City. Geckos sampling were conducted in residentials (Ciledug and Karang Tengah District) and traditional markets (Ciledug and Pinang District) by using road sampling method. Geckos were preserved in alcohol 70%. Ectoparasites mites were taken from the head, ears, armpits, body trunk, groin, tail, fore and hind fingers of the geckos. Mites slides preparation were made with whole mount methode using polivinil alkohol (PVA) media and dried on hot plate for one week at 40oC. The result showed that geckos from residential areas were identified as Cosymbotus platyurus, Hemidactylus frenatus, H. garnotii and Gehyra mutilata, while the geckos from the market were identified as C. platyurus, and H. garnotii. The mites were classified to the Pterygosomatidae Family, Genus Geckobia, namely Geckobia sp 4, Geckobia sp 5, Geckobia sp 6, Geckobia sp 7, Geckobia sp 8, Geckobia sp 9, Geckobia sp 10, and those mites are found to be new species based on the current mites key identification. Geckos from traditional markets showed more infested by the mites than those from the residentials. Geckos H. garnotii had the highest prevalence (100%) both in residentials and markets. The highest total intensity was also found in geckos H. garnotii, those were 17,8 and 15,9 in the residential and in the market, respectively
Keyword: 

Judul: Inventarisasi dan Identifikasi Tungau Ektoparasit pada Cicak di Pasar dan Suaka Margasatwa Muara Angke, Jakarta
Abstrak: Ectoparasites are form of parasite that stick on the surface of organism, suck their blood or looking for feed on hair, fur, skin, or skin secretions. This study was aimed to inventory, identify, and analize mites infestation in the lizard ectoparasites on market and Muara Angke conservation area, Jakarta. Lizards were collected and preserved in 70% alcohol. The sticky sites on lizard which could be infested are head, ears, armpits, torso, thighs, forelimbs, hind limbs, and tail. All mites were prepared with PVA media. The results showed that there were four species of Geckos, Cosymbotus platyurus, Hemidactylus garnotii, Hemidactylus frenatus, and Gehira mutilata. Identification results based on characters of mites found six types of Geckobia (G1, G2, G5, G6, G10, G11). However based on chaetotaxy the G5 and G11 were grouped as G. indica, G2 in G. glebosum, G6 were in Geckobia group 1, G10 in group with G. gleadoviana, and unidentified G1 geckos. Hemydactylus garnotii was found to had the largest prevalence values at market and conservation, i.e 94.4% and 73.3%. Hemydactylus garnotii also was found to had the largest infestation intensity values at market and conservation, i.e 28.1 and 7.7
Keyword: lizard, Geckobia, chaetotaxy, ectoparasite mites

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: