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 Kabupaten Cianjur
Abstrak: Ectoparasite mites are parasitic organisms that live on the surface of the host, sucking the blood or feed on hair, fur, skin, or skin secretions. This research aim to inventarisation and identification of mites ectoparasites on gecko in Cianjur areas. The research was conducted from January 2012 until July 2012. Gecko and mites were collected and preserved in 70% alcohol. Whole mount of the mites was prepared used polyvinyl alcohol media. The result showed that there are three species of gecko (Cosymbotus platyurus, Hemidactylus frenatus, and Gehyra mutilata) was infested by Geckobia mites. There are new seven spesies of Geckobia (G4, G5, G6, G7, G10, G11, and G12). Analysis of the presence of mites done by calculate the value of prevalence (P), the average intensity of infestation (I), and the total intensity (It). The prevalence in C. Platyurus gecko (P = 74.38%) is higher than G. mutilata (P = 50%), and H. frenatus (P = 33.33%), while the average infestation intensity (I) and total intensity (It) is the highest found in G. mutilata (I = 10 and It = 11). Geckobia G4 and Geckobia G10 were found only on C. platyurus; Geckobia G5 and Geckobia G12 were found on C. platyurus and G. mutilata; Geckobia G6 were found on whole infected gecko; Geckobia G7 were found on C. platyurus and H. frenatus; and Geckobia G11 were found on H. frenatus and G. mutilata. So it is concluded that the new seven species mites has not a specific distribution pattern of their hosts.
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: