Judul: Teknik Memanen Makrokonidia dari Dermatofita Microsporum gypseum dan Trichophyton mentagrophytes
Abstrak: Dermatofitosis adalah penyakit kulit yang disebabkan oleh kapang Dermatofita. Penelitian ini bertujuan menentukan teknik yang sesuai untuk memanen makrokonidia dari kapang dan waktu fase eksponensial Microsporum gypseum dan Tricophyton mentagrophytes. Media 1 dan 2 digunakan untuk pembiakan isolat M. gypseum dan T. mentagrophytes. Teknik penggoresan pada permukaan kolonidan penggoyangan tabung dengan vortex digunakan untuk memanen makrokonidia. Makrokonidia dipanen pada hari ke 10, 12, 14, 16, 18, dan 20. Hasil yang didapatkan menunjukkan jumlah rata-rata makrokonidia kapang yang dipanen dengan penggoresan pada permukaan koloni lebih tinggi daripada penggoyangan tabung menggunakan vortex selama masa pertumbuhan hingga hari ke-20. Hasil yang didapatkan juga menunjukkan fase eksponensial telah dimulai pada hari ke-14.
Keyword: dermatofitosis, Dermatofita, teknik memanen makrokonidia, Microsporum gypseum, Trichophyton mentagrophytes

Judul: Aktivitas Beberapa Antimikotik terhadap Microsporum gypseum sebagai Penyebab Dermatofitosis pada Kuda
Abstrak: Dermatophytosis is a superficial cutaneous fungal infection that attacks the keratin layer of the skin caused by a group of fungi known as dermatophytes. Microsporum gypseum is a geophilic dermatophyte that suspected to cause this infection in horses. In this research, isolation and identification of sample from the horse that was suspected to be infected with dermatophytosis caused by M.gypseum was done. As an effort to treat dermatophytosis, antimycotics are widely used. The aim of this study is to be able to diagnose accurately the cause of dermatophytosis in horses and the agent that causes it.The procedure of this research included rapid isolation and identification, using KOH 10%, isolation onto DSA media and identification using Riddle’s slide culture method. The antimycotic test was done using disk diffusion assay method and the antimycotics used in the test were ketoconazole, amphotericine, voriconazole, fluconazole, griseofulvin, and miconazole, producing inhibition zones with diameters 0 mm, 0 mm, 8.5 mm, 0 mm, 17.25 mm, and 12.25 mm respectively at the end of the test. This study revealed that griseofulvin has the best antimycotic activity against M.gypseum and can be used as the drug of choice for the treatment of dermatophytosis caused by the fungi.
Keyword: dermatophytosis, antimycotic activity test, Microsporum gypseum, horses

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