Judul: Beberapa aspek toksisitas temephos terhadap jentik Aedes (Stegomya) aegypt (Linnaeus) dalam hubungannya dengan sistem aplikasi pada pemberantasan demam berdarah
Abstrak: Penyakit demam berdarah (DB)adalah penyakit menular yang ditemukan pertama kali tahun 1968 di kota Surabaya dan Jakarta dengan jumlah penderita 58 orang dan angka kematian 41.3 %. Penyakit ini telah tersebar luas di seluruh Indonesia kecuali Propinsi Timor Timur, sehingga terjadi peningkatan jumlah penderita dan daerah yang terjangkit akan tetapi dengan angka kematian yang semakin rendah. DB dapat ditularkan melalui gigitan nyamuk Ae.aegypti yang tersebar luas di seluruh wilayah Indonesia. Penyebab penyakit ini adalah virus denggi (dengue) serotipe 1, 2, 3 dan 4 yang tergolong dalam grup B Arbovirus. Pemberantasan nyamuk Ae. aegypti sebagai vektor utama DB dapat dilakukan dengan tiga metode yaitu melalui sanitasi lingkungan yang bertujuan untuk mengurangi habitat jentik (source reduction), pemberantasan nyamuk dengan insektisida (adulticiding) dan pemberantasan jentik dengan insektisida (larvaciding).
Keyword: Aedes egypti;, Toxicology;, Dengue fever;

Judul: Status Resistensi Aedes Aegypti Terhadap Insektisida Golongan Organokarmabat Dan Pola Kejadian Demam Berdarah Dengue Di Kota Bogor
Abstrak: Demam Berdarah Dengue (DBD) merupakan salah satu penyakit penting di Indonesia yang ditularkan melalui vektor nyamuk. Pengendalian vektor dengan insektisida banyak digunakan dan dapat menimbulkan terjadinya masalah resistensi. Penelitian ini bertujuan untuk menentukan status resistensi Ae. aegypti terhadap bendiokarb dan menganalisis pola kejadian DBD di Kota Bogor. Penelitian dilakukan dengan cara standar WHO (1975) menggunakan susceptibility test kit dengan impregnated paper berbahan aktif bendiokarb 0,1%. Telur nyamuk Ae. aegypti diperoleh dengan menggunakan ovitrap dari 12 kelurahan di Kota Bogor. Telur-telur dipelihara sampai nyamuk generasi F2 kemudian diujikan terhadap insektisida bendiokarb. Hasil penelitian menunjukkan persentase kematian nyamuk pada 3 isolat Ae. aegypti (Sindang Rasa, Pamoyanan, Panaragan) telah resisten terhadap bendiokarb dan 9 isolat nyamuk Ae. aegypti (Sukadamai, Harjasari, Situgede, Semplak, Sindang Sari, Ciwaringin, Kayu Manis, Ciluar, dan Kedung Halang) berstatus toleran. Hubungan antara kasus DBD dengan indeks curah hujan dari tahun 2010 sampai 2013 menunjukkan nilai r = 0.264 dan nilai P = 0.07 > 0.05. Hasil ini menunjukkan bahwa adanya peningkatan indeks curah hujan diikuti oleh peningkatan kasus DBD tetapi hubungan ini tidak signifikan karena hanya berpengaruh sebanyak 26,4% pada peningkatan kasus DBD di Kota Bogor.
Keyword: Aedes aegypti, bendiokarb, demam dengue, resisten, toleran

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