Judul: Cendawan Pencemar di Pakaian Pegawai Pemandi Hewan (Groomer) Di Bebarapa Klinik dan Toko Hewan Piara di Kota Bogor, Jawa Barat
Abstrak: Cendawan terdiri atas jamur, khamir dan kapang. Cendawan tidak dapat melakukan fotosintesis, bersifat saprofit atau bahkan bersifat parasitik. Cendawan memperoleh nutrisi dengan cara absorbsi dan berkembangbiak menggunakan spora seksual dan aseksual. Tujuan penelitian ini adalah mengetahui keberadaan cemaran cendawan pada pakaian pegawai pemandi hewan sebelum kegiatan memandikan hewan dimulai. Cara usapan dan cara tempel digunakan untuk mengisolasi contoh yang diambil dari lima titik (kanan atas, kiri atas, tengah, kanan bawah dan kiri bawah) pada pakaian bagian depan pegawai pemandi hewan. Contoh diambil dari beberapa klinik dan toko hewan piara di wilayah Kota Bogor dan dibiakkan pada media agar SDA dan SDA-m. Hasil pengamatan menunjukkan bahwa terdapat 16 jenis cendawan yang dapat diisolasi dari pakaian pegawai pemandi hewan. Beberapa cendawan patogen seperti Fusarium sp., Aspergillus flavus, Aspergillus fumigatus dan Candida albicans dapat diisolasi dari contoh. Fusarium sp. merupakan jenis cendawan yang paling banyak diisolasi yaitu sebesar 20,00%.
Keyword: pakaian pegawai pemandi hewan, cendawan pencemar, klinik hewan peliharaan, toko hewan piara

Judul: Keberadaan Kapang Dermatofita Yang Diisolasi Dari Klinik Dan Toko Hewan Peliharaan Di Kota Bogor, Jawa Barat
Abstrak: Dermatofita adalah kelompok cendawan patogen kulit. Mereka dapat mencemari dan membentuk spora di lingkungan sehingga keberadaannya sulit dihilangkan. Tujuan penelitian ini adalah untuk mengetahui keberadaan Dermatofita, persentase cemaran kelompok cendawan Dermatofita, dan rasio spesies-spesies Dermatofita dengan cendawan lainnya di beberapa klinik dan toko hewan peliharaan di Kota Bogor. Penelitian dilakukan di 10 klinik dan toko hewan peliharaan. Contoh usapan lantai dan udara diambil dari ruang tunggu, ruang pemandian hewan, ruang inap, dan ruang periksa. Contoh usapan lantai dan udara ditanam di media pertumbuhan dan diinkubasi selama satu minggu pada suhu 37°C. Setelah masa inkubasi dicapai, koloni yang tumbuh didentifikasi secara makroskopik dan mikroskopik. Penelitian ini mengisolasi dan mengidentifikasi satu spesies Dermatofita, Microsporum canis. Spesies ini banyak terisolasi di media SDA yang dimodifikasi dari contoh yang berasal dari ruang periksa. Jumlah keberadaan Microsporum canis dari seluruh jenis cendawan yang terisolasi adalah 2,73% pada contoh usapan lantai dan 2,80% pada contoh udara dan rataan jumlah Dermatofita adalah 3,74% dari 10 lokasi pengambilan contoh.
Keyword: cendawan, Dermatofita, cemaran, klinik dan toko hewan

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