Judul: Studi Infestasi Dan Resistensi Kutu Busuk, Cimex Hemipterus (Hemiptera: Cimicidae) Terhadap Tiga Golongan Insektisida Di Bogor.
Abstrak: Kutu busuk, Cimex sp. merupakan ektoparasit pengisap darah manusia dan hewan dari ordo Hemiptera dan famili Cimicidae, yang penyebarannya di negara subtropis dan tropis. Kasus infestasi kutu busuk pada tahun 1970-an dianggap telah menghilang, akan tetapi sejak tahun 2000-an kasus infestasi kutu busuk kembali dilaporkan dari seluruh dunia. Studi mengenai infestasi kutu busuk ini dilakukan di wilayah kampus Institut Pertanian Bogor Dramaga dan sekitarnya dari Oktober 2014 - Februari 2015. Penelitian ini bertujuan untuk menentukan sebaran dan derajat infestasi kutu busuk, mengetahui aspek biologi kutu busuk, menentukan resistensi kutu busuk terhadap berbagai golongan insektisida serta menganalisis pengetahuan, sikap dan praktik masyarakat terhadap infestasi kutu busuk. Penelitian ini diharapkan dapat memberikan data dan informasi terbaru khususnya tentang studi infestasi kutu busuk di wilayah Bogor. Survei dan koleksi kutu busuk dilakukan pada dua tipe kawasan hunian yaitu perumahan dan tempat tinggal sementara. Tipe perumahan dibagi menjadi dua yaitu perumahan kompleks dan padat penduduk, sedangkan tipe tempat tinggal sementara dibagi menjadi empat yaitu asrama, pondok pesantren, indekos dan wisma penginapan. Selanjutnya, pengukuran resistensi kutu busuk dilakukan dengan menggunakan tiga golongan insektisida yaitu organofosfat (malation 5%), piretroid (deltametrin 0.05%) dan karbamat (propoksur 0.1%). Selain itu, untuk mengetahui pengetahuan, sikap dan praktik masyarakat terhadap infestasi kutu busuk dilakukan dengan mewawancarai responden menggunakan kuisioner. Hasil penelitian menunjukkan bahwa dari total 244 kamar yang diperiksa dari seluruh kawasan hunian, 64 kamar positif terinfestasi oleh satu jenis kutu busuk yakni Cimex hemipterus. Infestasi kutu busuk tertinggi ditemukan di asrama mahasiswa sebesar 25.41%, sedangkan tipe hunian lain terinfestasi rendah (0.41%) dan bahkan tidak ditemukan infestasi kutu busuk. Mortalitas kutu busuk terhadap malation menunjukkan angka tertinggi (87.50%) dan LT50 terpendek (0.14 hari). Selanjutnya, pada deltametrin mortalitas sebesar 21.43% dengan LT50 9.12 hari, sedangkan pada propoksur memperlihatkan angka mortalitas terendah (10%) dan LT50 terpanjang (12.88 hari). Hal ini menunjukkan bahwa populasi kutu busuk di asrama mahasiswa di wilayah kampus IPB Dramaga telah resisten terhadap tiga golongan insektisida, terutama propoksur. Hasil wawancara mengenai persentase pengetahuan, sikap dan praktik (PSP) masyarakat menunjukkan bahwa infestasi kutu busuk masih dikenali oleh banyak kalangan baik dari mahasiswa (81.20%), ibu rumah tangga (6.41%), pelajar (5.13%), dan masyarakat secara umum (2.42%). Masyarakat Bogor memiliki sikap dan praktik yang baik dalam mengendalikan infestasi kutu busuk di lingkungan tempat mereka tinggal.
Keyword: Cimex hemipterus, infestasi, kutu busuk, resistensi insektisida

Judul: STUDY OF INFESTATION AND DETECTION OF PATHOGENIC BACTERIA OF BEDBUGS (Cimex hemipterus) IN HOUSING AREAS
Abstrak: Kutu busuk (Cimex hemipterus) adalah ektoparasit pengisap darah pada manusia dan hewan yang tersebar di seluruh dunia. Ektoparasit ini merupakan bagian dari ordo Hemiptera dan famili Cimicidae. Infestasi kutu busuk sering ditemukan di kawasan permukiman namun belum banyak data tercatat di Indonesia. Penelitian ini bertujuan untuk mengetahui sebaran, derajat infestasi, dan deteksi bakteri patogen pada kutu busuk. Lokasi penelitian berada di dua kawasan permukiman daerah Bogor dan satu kawasan Bandung. Koleksi kutu busuk dilakukan secara manual menggunakan pinset dan diidentifikasi berdasarkan kunci morfologi. Deteksi bakteri pada kutu busuk dilakukan dengan menggunakan metode PCR. Hasil penelitian menunjukkan bahwa infestasi tersebar di area kasur, dipan, karpet, keranjang baju, dan boneka. Derajat infestasi di lokasi Bogor tergolong kategori tinggi sedangkan di lokasi Bandung tergolong rendah. Berdasarkan hasil PCR dan sekuensing ditemukan bakteri simbion yaitu Afipia clevelandensis, Afipia sp. dan Pseudomonas entomophila. Afipia clevelandensis dan Afipia sp. diketahui sebagai patogen manusia sementara Pseudomonas entomophila diketahui sebagai entomopatogen., Bedbugs (Cimex hemipterus) is a blood-sucking ectoparasite of humans and animals that spread around the world. This ectoparasite is belong to the Hemiptera order and Cimicidae family. Bedbugs are often found in housing areas but not much data is recorded in Indonesia. This study aimed to determine bedbugs distribution, the degree of infestations, and detection of pathogenic bacteria in bed bugs. The research was located in two housing areas in Bogor and Bandung. Bedbugs were collected manually using forceps and then identified according to morphological keys. Detection of bedbugs bacteria conducted by PCR method. The results showed that infestations spread in the bed, divan, carpet, clothes basket, and dolls. The highest degree of infestation was in Bogor whereas Bandung had a low degree of infestation. Based on the PCR and sequencing results symbiont bacteria that have been discovered were Afipia clevelandensis, Afipia sp. and Pseudomonas entomophila. Afipia clevelandensis and Afipia sp. are known as human pathogen on the other hand, Pseudomonas entomophila is known as entomopathogen.
Keyword: Bacteria, Cimex hemipterus, degree of infestation, pathogen

Judul: The Construction of Greedy SVP LLL Algorithm
Abstrak: A lattice is a set of all integer linear combination of a set of linearly independent vectors in ℝ𝑛���. The independent vectors are called bases of lattice. Any lattice can be generated from many bases, and these bases have the same cardinality. In the lattice, the most fundamental and renowned problem is the Shortest Vector Problem (SVP). SVP is a tracking problem of the shortest nonzero vector in a lattice with equivalent bases. In two dimensions, SVP problem has resolved exactly by Gauss’ algorithm. When the lattice dimension is higher than two, A.K. Lenstra, H.W. Lenstra and L. Lovasz gave a LLL algorithm to compute approximation of nonzero shortest vector in the lattice. Reduced bases solution obtained from LLL algorithm still be an approximation and has polynomial running time of arbitrary dimension which large enough. In 1994, Schnoor and Euchner modified this LLL algorithm as a new variant which later was named deep insertion LLL algorithm. This algorithm is a modified version of the LLL algorithm to the terms of the exchange step to improve the accuracy of output of LLL reduced bases and applying it to the subset sum problem. The purpose of this research are: (1) Reconstruct the LLL algorithm and deep insertion LLL algorithm using a geometric approach. (2) Construct a greedy SVP LLL algorithm. (3) Implement the three algorithms in a symbolic programming language, and evaluate them experimentally. A bases ℬ=[𝐛���1,𝐛���2,…,𝐛���𝑛���] in ℝ𝑚��� is called reduced LLL with parameter 𝛿��� if satisfies: (a) |𝜇���𝑗���𝑖���|≤12, for every integer 𝑖���,𝑗��� with 1≤𝑖���<𝑗���<𝑛���. (b)𝛿���‖𝜋���𝑗���(𝐛���𝑗���)‖2≤‖𝜋���𝑗���(𝐛���𝑗���+1)‖2, for 𝑗���=1,2,…,𝑛���−1,where 𝛿��� is a reduced parameter of real numbers with 14<𝛿���<1. The first requirement is the reduced basis 𝛿��� must “nearly orthogonal” and in its computation case, this requirement can be reached out by using the Gram-Schmidt’s orthogonalization. While the second requirement is called exchange step, or used to called as Lovasz condition. By using both of these requirements, then they establish the LLL algorithm. Then, Schnoor and Euchner modify the LLL algorithm based on the requirements of the exchange step called the deep insertion LLL algorithm, where the exchange step is based on the comparison of the projected vector in orthogonal complement [𝐛���1,𝐛���2,…,𝐛���𝑘���−1]⊥ after j-th reduction. To construct greedy SVP LLL algorithm, the requirements of the exchange step is based on purely by comparing norm of lattice 𝐛���𝑗��� with norm lattice 𝐛���𝑖��� for 𝑖���=1,2,3…,𝑗���−1. The process of insertion reduced vector after the exchange step also has done greedily. Then, we calculate the number of arithmetic operation in greedy SVP LLL algorithm for further analysis. The result of our exprimentation for three algorithms on the certain matrix size shows that the running time of the three algorithms increases propotional to the size of the matrix. The result also shows that by using 𝛿���=34 for the LLL algorithm and the deep insertion LLL algorithm, and the greedy SVP LLL algorithm which is a new variant made by using no parameter of 𝛿���, outperform of the other of two previous algorithm in terms of speed with the same output.
Keyword: LLL algorithm, LLL deep insertion algorithm, greedy SVP LLL algorithm