Judul: Beberapa sifat ekologik perairan yang potensial sebagai tempat perindukan anopheles sundaicus rod di kepenghuluan berakit pulau Bintan
Abstrak: Pemeriksaan darah penduduk pada tahun 1982 di Kepenghuluan Berakit, menghasilkan angka preparat darah positif parasit malaria adalah 22,1. Kegiatan survey untuk menentukan nyamuk pemindah malaria dilakukan oleh Direktorat Jendral Pencegahan dan Pemberantasan Penyakit Menular dan dikonfirmasi sebagai vektor adalah An. sundaicus. Direktorat Jendral Pencegahan dan Pemberantasan Penyakit Menular bekerja sama dengan Departemen Parasitologi dan Patologi Umum Fakultas Kedokteran Universitas Indoresia dan Badan Litbang Kesehatan untuk menemukan cara pencegahan malaria dengan mengikut sertakan peran aktif masyarakat. Penelitian ini diharapkan dapat mendukung usaha bersama tersebut, dengan mencari data mengenai faktor kimia fisik dan biotik habitat perindukan An. sundaicus, meneliti produktivitas/studi populasi larva dan menentukan musuh-musuh hayati larva An. sundaicus.
Keyword: Plankton;, Larva population;, Salinitas;, Bogor Agricultural University;

Judul: Beberapa aspek ekologi tempat perindukan Anopheles sundaicus Rodenwaldt dalam kaitannya dengan epidemiologi malaria di desa Labuan Lombok, Lombok Timur
Abstrak: Tujuan penelitian ini adalah untuk mengetahui kondisi Sungai l,egundi dan Sungai Larem yang terletak di Desa Labuan Lombok, sebagai habitat pradewasa Aspek-aspek ekologi yang di teli ti di An. sundaicus. kedua sungai tersebut adalah salinitas, pH dan vegetasi air serta kepadatan populasi nyamuknya. Di Sungai Legundi, basil pengukuran salinitas air di zone A, B dan C antara 1 - 6 permil. Zone A rata-ratanya 5,3 permil, B 1,97 permil dan C 1,63 permil. Hasil pengulmran pH di zone A, B dan C antara 6 - 7. Zone A rata-ratanya 6,50, B 6,87 dan C 7. Vegetasi air yang ads di sungai terse but adalah ganggang Enteromorpha, Cladophora dan rumput Cynodon dactylon. Hasil penangkapan nyamuk Anopheles dengan perangkap "emergence" antara lain An. sundaicus, An. subpictus dan An. vagus dengan total tangkapan 2. I 80, 215 dan 422 nyamuk. Khusus hasil penangkapan An. sundaicus untuk masing-masing zone, rata-rata setiap perangkap/hari adalah zone A 2,65, H J ,81 dan C 1,61 nyamuk. Hasil penangkapan larva Anopheles dengan cidukan didapatkan rata-rata setiap ciduk untuk masing-masing zone adal.ah zone A 21,73, B 14,17 dan C 13,47 jentik. ...
Keyword: Anopheles sundaicus

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