Judul: Aspek penting tungau debu rumah dermatophagoides(Arachnida:Acariformes) bagi kesehatan
Abstrak: Tulisan ini merupakan rangkuman berbagai literatur mengenai aspek penting tungau debu rumah Dermatophagoides (kelas Arachnida: Ordo Acariformes). Uraian secara lengkap mengenai Dermatophagoides dimulai dari taksonomi dan klasifikasi, morfologi, daur hidup, habitat dan perilaku, serta aspek penting bagi kesehatan. Selain itu, tulisan ini juga dilengkapi dengan berbagai cara pencegahan dan pengendalian tungau debu rumah (TDR)
Keyword: 

Judul: Prevalensi dan Derajat Infestasi Tungau Debu Rumah di Asrama Mahasiswa.
Abstrak: Tungau debu rumah (TDR) merupakan komponen alergenik yang menyebabkan asma dan rhinitis pada manusia. TDR banyak ditemukan pada rumah yang lembab, kasur, bantal, guling, karpet serta berbagai perabot rumah yang lain. Penelitian ini bertujuan untuk mengetahui prevalensi investasi tungau debu rumah, mengidentifikasi keanekaragaman dan distribusi tungau debu rumah, dan menentukan derajat investasi tungau debu/ gram debu di Asrama Mahasiswa IPB Bogor. Penelitian ini dilakukan pada wilayah Asrama Mahasiswa IPB dengan lokasi pengambilan debu terdiri dari tiga titik yaitu, tempat tidur, perabot, dan lantai dengan menggunakan penyedot debu (vacum cleaner) kemudian TDR diisolasi dan diidentifikasi di bawah mikroskop di laboratorium. Hasil penelitian menunjukkan sebaran TDR di Asrama Putra terbanyak di lantai (73.33%), diikuti oleh tempat tidur (27.11%), dan perabot (26.94%). Rata-rata kepadatan TDR tertinggi di lantai (22 tungau/gram debu). Sebaran TDR di Asrama Putri terbanyak di perabot (48.50%), lantai (29.66%), dan tempat tidur (21.84%). Rata-rata kepadatan TDR tertinggi di perabot (22 tungau/gram debu). Sebanyak 2105 TDR yang diidentifikasi di Asrama terdapat enam jenis TDR yang ditemukan pada Asrama yaitu Blomia tropicalis (42.42%), Dermathophagoides pteronyssinus (19.10%), Cheyletidae (14.63%), Blomia spp (9.83%), Mesostigmata (8.79%), Dermathophagoides farinae (5.23%). TDR berpotensi mengganggu kesehatan penghuni asrama.
Keyword: Blomia, Dermathophagoides, mahasiswa asrama, tungau debu rumah

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