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 kerantanan nyamuk culex quinquefasciatus dari beberapa daerah terhadap insektisida transflutrin MC
Abstrak: Tujuan penelitian ini adalah untuk mengamati status kerentanan nyamuk Culex quinquefasciatus terhadap transflutrin MC yang diperoleh dari berbagai lokasi, yaitu isolat Dramaga, Bogor, Depok, Jakarta Barat, Jakarta Timur, dan laboratorium. Pengamatan dilakukan di dalam Peet Grady Chamber. Sebanyak 100 ekor Culex quinquefasciatus dimasukkan ke dalam empat buah kandang silinder berkasa dan digantungkan pada tiap sudut Peet Grady Chamber. Transflutrin MC diletakkan di tengah ruangan dan dibakar. Pengamatan dilakukan setiap lima menit hingga semua nyamuk mengalami kelumpuhan atau selama dua jam. Hasil penelitian menunjukkan bahwa nyamuk Culex quinquefasciatus yang memiliki tingkat kerentanan dari yang tertinggi hingga yang terendah berdasarkan nilai Knockdown Time 50% (KT50) adalah isolat laboratorium (19.31 menit), Dramaga (41.21 menit), Bogor (52.81menit), Depok (59.12 menit), Jakarta Timur (73.97 menit), dan Jakarta Barat (78.84 menit), sedangkan tingkat kerentanan berdasarkan nilai Knockdown Time 90% (KT90) berturut-turut dari yang tertinggi hingga terendah adalah isolat laboratorium (28.14 menit), Dramaga (62.65 menit), Depok (76.74 menit), Bogor (82.47 menit), Jakarta Timur (89.24 menit), dan Jakarta Barat (100.47 menit). Isolat dengan nilai Lethal Concentration 50% (LC50) berturut-turut dari yang terendah hingga yang tertinggi adalah isolat laborartorium (0.00034%), Dramaga (0.03415%), Bogor (0.05780%), Depok (0.10450%), Jakarta Timur (0.14156%), dan Jakarta Barat (0.18545%). Berdasarkan nilai LC50, diketahui bahwa isolat dengan nilai Resistance Ratio (RR) dari yang tertinggi hingga terendah bila dibandingkan dengan isolat laboratorium berturut-turut adalah isolat Jakarta Barat (545.44 kali), Jakarta Timur (416.35 kali), Depok (307.35 kali), Bogor (170.00 kali), Dramaga (100.44 kali), dan laboratorium (1.00 kali).
Keyword: Culex quinquefasciatus, Transflutrin, KT50, KT90, LC50, RR

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