Judul: Density and Behavior Aedes (Diptera: Culicidae) in Babakan Village Bogor Regency.
Abstrak: Berbagai tindakan telah dilakukan untuk menurunkan kasus Demam Berdarah Dengue, di antaranya gerakan 3M (menutup penampungan air, mengubur barang bekas, dan menguras penampungan air), dan pengasapan. Dalam melakukan upaya pengendalian dibutuhkan pengetahuan tentang kepadatan dan perilaku vektor nyamuk. Penelitian ini bertujuan mengetahui kepadatan populasi nyamuk Aedes, serta mempelajari perilaku menggigit dan istirahat nyamuk Aedes. Penelitian ini dilakukan di wilayah permukiman padat penduduk lingkar kampus IPB, Desa Babakan, Kecamatan Darmaga, Kabupaten Bogor, pada Februari- Juli 2011. Koleksi nyamuk dilakukan dengan penangkapan nyamuk berumpan manusia (landing collection) dan nyamuk yang beristirahat (resting collection) baik di dalam maupun di luar rumah. Hasil penelitian menunjukkan bahwa jenis nyamuk terbanyak yang menghisap darah dan beristirahat di dalam rumah adalah Ae. aegypi (0.34 nyamuk/jam/orang). Jumlah nyamuk terbanyak yang menghisap darah di luar rumah adalah Ae. albopictus (0.3 nyamuk/jam/orang), namun tidak diketahui apakah nyamuk ini lebih menyukai beristirahat di dalam atau di luar rumah.
Keyword: 

Judul: Density And Behaviour of Mosquitoes (Diptera : Culicidae) in Bojong Rangkas Village Bogor District
Abstrak: Penelitian ini bertujuan untuk mengetahui jenis, kepadatan, dan perilaku nyamuk serta hubungannya terhadap suhu, kelembaban, dan curah hujan di daerah Cikampak, Desa Bojong Rangkas, Kabupaten Bogor. Penelitian ini dilakukan pada bulan Oktober 2010 s/d Juni 2011 dan data diambil dengan menggunakan metode bare leg collection. Dari 1350 nyamuk subfamili Culicinae yang tertangkap, Culex quinquefasciatus merupakan spesies yang paling banyak ditemukan (89,63 %) diikuti dengan Cx. hutchinsoni (6,22 %), Cx. tritaeniorynchus (2,96 %), dan Ae. albopictus (1,19 %). Nilai man biting rate dan man hour density tertinggi terlihat pada Cx. quinquefasciatus sebesar 28,81 nyamuk/orang/malam dan 10,80 nyamuk/orang/jam. Selain itu, puncak aktivitas menggigit Cx. quinquefasciatus terjadi pada pukul 23.00 s/d 24.00 dan terdapat hubungan yang positif terhadap kelembaban ruang namun memiliki hubungan yang negatif terhadap curah hujan.
Keyword: 

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