Judul: Malassezia pachydermatis Isolated From Dogs and Cats in Jabodetabek Area Clinics
Abstrak: Malassezia pachydermatis merupakan flora normal pada kulit anjing dan kucing. Khamir ini dapat menyebabkan dermatitis jika populasinya meningkat. Tujuan penelitian ini adalah mengisolasi dan mengetahui hubungan faktor predisposisi (jenis kelamin, umur, jenis rambut, rutinitas mandi, dan lokasi infeksi) terhadap infeksi M. pachydermatis. Spesimen dan data pasien diperoleh dari klinik dan tempat praktik dokter hewan di Jabodetabek. Sebanyak 35 contoh dari 22 anjing dan 13 kucing diambil menggunakan usapan dan disimpan dalam media pembawa Potato Dextrose Broth dengan minyak zaitun. Spesimen diperiksa mikroskopik dengan perbesaran 400x menggunakan pewarna lactophenol cotton blue dan dilakukan isolasi dengan media Potato Dextrose Agar dengan minyak zaitun. Media diinkubasi pada suhu 37 oC selama satu minggu. Dilakukan pengujian kebutuhan terhadap lipida, uji katalase, dan uji urease pada koloni terduga. Hasil penelitian memperlihatkan bahwa keberadaan M. pachydermatis pada anjing (40,91%) lebih tinggi dibandingkan kucing (15,38%). Faktor jenis kelamin, umur, jenis rambut, rutinitas mandi, dan lokasi infeksi tidak nyata (p>0,05) terhadap infeksi pada anjing dan kucing.
Keyword: cats, dogs, Malassezia infection, Malassezia pachydermatis, Dermatitis, Faltor predisposisi, Jenis kelamin, Inkubasi, Isolasi, Populasi, Potato dextrose, Lactophenol cotton blue

Judul: Prevalensi Dermatomikosis pada Anjing dan Kucing di Ting & Lu Veterinary Center, Kuching
Abstrak: Dermatomycosis is a skin infection caused by dermatophytes and other opportunistic fungi on pet animals. The aim of this study is to assess the prevalence of cats and dogs that were diagnosed with some form of dermatomycosis in Ting and Lu Veterinary Center from November 2020 to January 2021. Signalment and treatment done were taken from the medical records. Treatments for the infection are usually antifungal cream, medicated shampoo and antibiotics for secondary infections. The prevalence of dermatomycosis cases is dependent on several variables such as the humidity, lifestyle of the animal, hair length and the variability of the different cat and dog breeds in the area. Cats at their prime age (3 to 6 years) were most commonly diagnosed at 60%, while dogs in their adult age (2 to 6 years) were most commonly diagnosed at 61.11%. The most predisposed breed for this study is domestic short-haired cats at 60% and local dogs at 37.84%. The data collected also shows that dermatophytes affect 100% of the cats that were affected with dermatomycosis during the study while in dogs it only affects 16.22% of the cases with the other 83.78% are Malassezia infection., Dermatomikosis adalah infeksi kulit yang disebabkan oleh dermatofita dan jamur oportunistik lainnya pada hewan peliharaan. Tujuan penelitian ini adalah untuk mengetahui prevalensi kucing dan anjing yang diteliti dengan beberapa bentuk dermatomikosis di Ting and Lu Veterinary Center dari November 2020 hingga Januari 2021. Sinyal dan perawatan yang dilakukan diambil dari rekam medis. Perawatan untuk infeksi biasanya krim antijamur, sampo obat dan antibiotik untuk infeksi sekunder. Prevalensi kasus dermatomikosis bergantung pada beberapa variabel seperti kelembaban, gaya hidup hewan, kepanjangan rambut dan ras kucing dan anjing yang berbeda di daerah tersebut. Kucing pada usia prima (3 hingga 6 tahun) paling sering didiagnosis dengan dermatomikosis pada 60%, sedangkan anjing pada usia dewasa (2 hingga 6 tahun) paling sering didiagnosis pada 61,11%. Ras yang paling cenderung untuk penelitian ini adalah kucing peliharaan bulu pendek sebesar 60% dan anjing lokal sebesar 37,84%. Data yang terkumpul juga menunjukkan bahwa dermatofita menyerang 100% kucing yang terkena dermatomikosis pada durasi studi sedangkan pada anjing hanya menyerang 16,22% kasus dengan 83,78% lainnya merupakan infeksi Malassezia
Keyword: Canine, Dermatomycosis, Feline, Fungal, Prevalence

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