Judul: Status kerentanan nyamuk culex quinquefasciatus dari berbagai daerah terhadap insektisida metoflutrin MC
Abstrak: Penelitian ini bertujuan untuk menentukan status kerentanan nyamuk Culex quinquefasciatus isolat laboratorium dan lapangan terhadap metoflutrin MC. Isolat lapangan dikumpulkan dari Bogor, Depok, dan Jakarta, sedangkan isolat laboratorium berasal dari Penang (Malaysia). Pengujian dilakukan di dalam ruangan Peet Grady Chamber (PGC). Sebanyak 25 ekor nyamuk betina yang berumur 2-5 hari digantungkan dalam empat kurungan nyamuk. Nyamuk diletakkan pada setiap sudut ruangan Peet Grady Chamber. Metoflutrin MC yang telah dibakar diletakkan di tengah-tengah ruangan. Pengamatan dilakukan setiap lima menit hingga seluruh nyamuk mengalami kejatuhan atau selama dua jam. Jenis metoflutrin MC yang digunakan terdiri atas lima jenis konsentrasi yaitu 0.0010%, 0.0050%, 0.0075%, 0.0090%, dan 0.0150%. Hasil penelitian menunjukkan bahwa Culex quinquefasciatus yang paling rentan terhadap metoflutrin MC berdasarkan KT50 secara berturut-turut dari tertinggi adalah isolat laboratorium, Dramaga, Bogor, Depok, Jakarta Timur, dan Jakarta Barat, sedangkan berdasarkan KT90 adalah isolat laboratorium, Dramaga, Depok, Bogor, Jakarta Timur dan Jakarta Barat. Konsentrasi letal 50 (LC50) metoflutrin MC terhadap Culex quinquefasciatus pada 60 menit pasca kontak secara berturut-turut dari terendah hingga tertinggi adalah isolat laboratorium (0.00193%), Dramaga (0.00618%), Bogor (0.00766%), Depok (0.00977%), Jakarta Barat (0.04507%), dan Jakarta Timur (0.63510%). Nilai ratio resistensi (RR) secara berturut-turut dari terendah hingga tertinggi isolat laboratorium (1.00 kali), Dramaga (3.20 kali), Bogor (3.97 kali), Depok (5.06 kali), Jakarta Barat (23.35 kali), dan Jakarta Timur (329.08 kali).
Keyword: Metoflutrin, Culex quinquefasciatus, KT50, KT90, LC50, RR

Judul: Status kerentanan nyamuk Culex quinquefasciatus dari berbagai daerah terhadap insektisida D-Aletrin MC
Abstrak: Tujuan penelitian ini adalah untuk menentukan status kerentanan nyamuk Culex quinquefasciatus isolat laboratorium dan lapangan terhadap d-aletrin MC. Isolat lapangan dikumpulkan dari genangan air di daerah Bogor, Depok, dan Jakarta, sedangkan isolat laboratorium berasal dari Penang (Malaysia). Pengujian dilakukan di dalam Peet Grady Chamber (PGC). Sebanyak empat kurungan nyamuk yang berisi masing-masing 25 ekor nyamuk betina berumur 2-5 hari digantungkan pada keempat sudut PGC. D-aletrin MC yang telah dibakar diletakkan di tengah-tengah ruangan. Insektisida d-aletrin MC yang digunakan terdiri atas lima jenis konsentrasi yaitu 0.100 w/w, 0.200% w/w, 0.300% w/w, 0.400% w/w, dan 0.500% w/w. Pengamatan dilakukan setiap lima menit sekali selama dua jam hingga seluruh nyamuk mengalami kejatuhan. Hasil penelitian menunjukkan bahwa Culex quinquefasciatus yang paling rentan terhadap d-aletrin MC berdasarkan nilai KT50 secara berturut-turut adalah isolat Laboratorium, Bogor, Dramaga, Depok, Jakarta Barat, Jakarta Timur, sedangkan berdasarkan nilai KT90 adalah isolat Bogor, Laboratorium, Depok, Dramaga, Jakarta Timur, dan Jakarta Barat. Adapun konsentrasi letal 50 (LC50) d-aletrin MC terhadap Culex quinquefasciatus dalam waktu 60 menit setelah terpapar secara berturutturut adalah isolat Laboratorium (0.14%), Dramaga (0.29%), Bogor (0.38%), Depok (0.59%), Jakarta Barat (0.70%), dan Jakarta Timur (1.54%). Rasio resistensi (RR) digunakan untuk membandingkan kepekaan suatu populasi nyamuk dengan yang lainnya terhadap suatu insektisida. Nilai RR dari setiap isolat secara berturut-turut adalah Laboratorium (1.00 kali), Dramaga (2.07 kali), Bogor (2.71 kali), Depok (4.21 kali), Jakarta Barat (5.00 kali), dan Jakarta Timur (11.00 kali).
Keyword: D-allethrin, Resistance Ratio(RR), Bogor Agricultural University

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