Judul: Fauna dan Status Kerentanan Nyamuk Anopheles spp terhadap Insektisida Sintetik Piretroid di Kecamatan Ujung Bulu Kabupaten Bulukumba Provinsi Sulawesi Selatan
Abstrak: Malaria remains a public health problem in Indonesia. The research aimed to assess fauna and the activity of Anopheles spp as suspected malaria vector and the susceptibility status to insecticides synthetic pyrethroids. The research was done on February to August 2011 in the Village of Caile which belong to rice field area and in Village of Ela-Ela which belong to coastal area. The Anopheles mosquitoes were collected indoor and outdoor by human landing collection and resting collection in the evening starting from 6 p.m. to 6 a.m. The resting collection was also carried out in the morning from 6-7 a.m. The result showed that in the Village of Caile it was found 6 species i.e. species of An. barbirostris, An. vagus, An. subpictus, An. indefinitus, An. nigerrimus and An. tesselatus. The peak biting activity of An. barbirostris was at 12-1 a.m., An. subpictus at 8 to 9 p.m. and An. vagus at 7 to 8 p.m. In Village of Ela-Ela there were found five species i.e. An. barbirostris, An. subpictus, An. vagus, An. indefinitus and An. nigerrimus. The peak biting activity of An. barbirostris was at 6 to 7 p.m., An. subpictus at 10 to 11 p.m. and An. vagus at 12-1 a.m Keywords : Anopheles, malaria, susceptible,. The susceptibility status of An. barbirostris from Caile village was still susceptible against Lambda cyhalothrin 0.05% and An. subpictus from Ela-Ela village was still susceptible againts deltamethrin 0.05%.
Keyword: 

Judul: Kajian Entomologis Anopheles spp. sebagai Dasar Penyusunan Strategi Integrated Vector Management (IVM) dalam Upaya Eliminasi Malaria di Kabupaten Nunukan Provinsi Kalimantan Utara.
Abstrak: Malaria merupakan satu di antara permasalahan kesehatan masyarakat dan masih menjadi penyakit prioritas bagi Kementerian Kesehatan (Kemenkes) Indonesia. Kemenkes (2016) melaporkan bahwa dari total 258 924 888 penduduk Indonesia pada tahun 2016, masih terdapat 80 209 723 penduduk (31%) hidup di daerah endemis malaria. Kabupaten Nunukan merupakan daerah transit TKI dari Malaysia dan sebagai pintu masuk negara, sehingga pengendalian penyakit malaria menjadi prioritas. Penularan malaria di Pulau Sebatik terindikasi telah terjadi penularan setempat (indigenous), tetapi data tentang bioekologi Anopheles sebagai vektor dan pola perilakunya belum tersedia. Berdasarkan permasalahan tersebut, diperlukan penelitian tentang aspek-aspek entomologi Anopheles spp. dan efektivitas kelambu berinsektisida serta alternatif pendekatan pengendalian vektor terpadu (integrated vector management-IVM) di daerah endemis malaria yaitu Desa Sungai Nyamuk, Pulau Sebatik. Jumlah nyamuk Anopheles yang tertangkap di Desa Sungai Nyamuk selama observasi 18 bulan sebanyak 5103 nyamuk betina dan telah teridentifikasi 11 spesies yaitu An. vagus, An. sundaicus, An. subpictus, An. indefinitus, An. peditaeniatus, An. nigerrimus, An. tesselatus, An. barbirostris, An. letifer, An. umbrosus dan An. barbumbrosus. Pengujian konfirmasi vektor malaria di Desa Sungai Nyamuk menggunakan enzyme linked immunosorbent assay (ELISA) telah dilakukan terhadap 2259 nyamuk betina parous (44.3%), dari total 5103 nyamuk Anopheles betina yang tertangkap. Hasil pengujian menunjukkan bahwa 1 nyamuk An. peditaeniatus dari penangkapan outdoor biting (3.8%, n=26) dan 1 nyamuk An. sundaicus dari penangkapan outdoor biting (0.6%, n=157), positif terhadap P. falciparum circum sporozoite protein (CSP). Nilai penghitungan kapasitas vektor An. peditaeniatus (0.01) dan An. sundaicus (0.04). Laju inokulasi entomologi An. peditaeniatus dan An. sundaicus adalah 0.08 (~28 gigitan infektif /orang/tahun). Hal ini menunjukkan bahwa kedua jenis nyamuk Anopheles tersebut terkonfirmasi sebagai vektor malaria di Desa Sungai Nyamuk. Konfirmasi vektor tersebut juga menunjukkan bahwa pola penularan malaria di Desa Sungai Nyamuk terjadi di luar rumah dan disebabkan oleh P. falciparum. Konfirmasi vektor ini juga membuktikan bahwa penularan kasus malaria di Desa Sungai Nyamuk, Pulau Sebatik telah terjadi penularan setempat (indigenous). Anopheles peditaeniatus yang ditemukan positif mengandung P. falciparum CSP merupakan penemuan yang sangat penting bagi bidang entomologi kesehatan di Indonesia, karena selama ini spesies tersebut belum pernah dilaporkan terkonfirmasi mengandung sporozoit Plasmodium. Anopheles peditaeniatus di Desa Sungai Nyamuk mempunyai perilaku antropofilik dan endofilik dengan puncak kepadatan An. peditaeniatus terjadi pada jam 24.00- 01.00. Anopheles peditaeniatus hasil penangkapan dengan umpan orang luar (outdoor biting) tersebut harus mendapatkan perhatian yang serius karena telah terbukti mengandung CSP Plasmodium falciparum melalui pemeriksaan ELISA. vi Hasil penelitian ini merupakan penelitian pertama di Indonesia yang mengkonfirmasi bahwa An. peditaeniatus positif mengandung Plasmodium dalam kondisi normal di alam. Kejadian kasus malaria di Desa Sungai Nyamuk ditemukan setiap bulan. Curah hujan jika dikorelasikan dengan kejadian kasus malaria, menunjukkan korelasi nyata karena didapatkan nilai p=0.01 (p<0.05). Hasil uji korelasi Pearson antara angka gigitan Anopheles per orang per malam (MBR) dengan faktor-faktor meteorologi menunjukkan bahwa terdapat korelasi antara MBR dengan curah hujan. Habitat perkembangbiakan potensial Anopheles spp. di Desa Sungai Nyamuk terdiri atas 4 tipe yaitu lagun, parit, tambak ikan terbengkalai dan rawarawa. Tambak ikan yang terbengkalai merupakan habitat perkembangbiakan Anopheles yang bersifat permanen karena ditemukan larva Anopheles setiap bulan pengamatan. Pengendalian vektor malaria di Desa Sungai Nyamuk menggunakan kelambu
Keyword: An. peditaeniatus, Konfirmasi Vektor, Kelambu Berinsektisida, Eliminasi Malaria, Kalimantan Utara

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