Judul: Isolasi dan Identifikasi Enterobacteriaceae dari Usap Mukosa Hidung Kuda
Abstrak: Kuda merupakan salah satu hewan dekat manusia yang memiliki risiko terkena infeksi Enterobacteriaceae. Tujuan penelitian ini adalah mengisolasi dan mengidentifikasi Enterobacteriaceae pada traktus respiratori kuda melalui morfologi dan metode biokimia. Sampel usap hidung yang diambil dari dua ekor kuda dibiakkan pada media agar darah, agar brain-heart infusion, dan agar Mac-Conkey. Karakter pertumbuhan koloni diamati. Mikromorfologi bakteri dari koloni murni diamati dengan pewarnaan Gram. Sebanyak 10 isolat representatif Enterobacteriaceae dipilih untuk uji biokimia meliputi oksidase, katalase, sulfide indole motility, methyl red-Voges Prosakuer, sitrat Simmon, urease Christensen, dan triple sugar iron agar. Analisa uji biokimia mengidentifikasi isolat-isolat sebagai Yersinia, Edwardsiella, dan Shigella.
Keyword: Enterobacteriaceae, kuda, usap hidung

Judul: Isolasi dan Karakterisasi Bakteri Proteolitik Asal Feses Kuda (Equus caballus)
Abstrak: Penelitian ini bertujuan untuk mengisolasi dan menyeleksi bakteri proteolitik sebagai kandidat bakteri pendegradasi protein asal feses kuda secara morfologi dan biokimia. Penelitian dilakukan dalam tiga tahap. Tahap pertama adalah isolasi bakteri asal feses kuda dengan Skim Milk Agar + Rumen 10% dan tahap kedua dilakukan skrining bakteri proteolitik untuk mengetahui nilai indeks proteolitik tertinggi. Tahap ketiga dari hasil isolat terpilih dilanjutkan serangkaian uji karakterisasi yang meliputi uji gula pereduksi, uji makroskopis, uji katalase, pewarnaan gram, dan uji aktivitas enzim protease. Analisis aktivitas enzim menggunakan Rancangan Acak Lengkap (RAL) pola faktorial dengan perlakuan suhu dan pH. Suhu yang diuji adalah 40 ℃, 50 ℃, dan 60 ℃, pH yang diuji adalah 5, 6, 7, 8 dengan 3 kali ulangan. Hasil penelitian didapatkan isolat dengan nilai indeks proteolitik tertinggi yaitu isolat 1 (985.T.K.1.4 di SMA), isolat 2 (985.T.K.1.4 di SMA+R) dan isolat 3 (SMA+R.K.4.10). Hasil uji karakterisasi menunjukkan bahwa ketiga isolat memiliki morfologi yang hampir sama. Ketiga isolat tersebut merupakan bakteri gram negatif, dapat mendegradasi gula pereduksi dan memiliki aktivitas katalase. Pengujian morfologi menunjukkan bahwa ketiga isolat termasuk genus Bacteroides. Uji aktivitas enzim protease menunjukkan bahwa ketiga isolat melakukan aktivitas optimum pada suhu 60 ℃ dan pH 5 dengan nilai aktivitas enzim isolat 1 sebesar 0,027 U mL-1, isolat 2 dan 3 sebesar 0,018 U mL-1. Kesimpulannya, isolat 2 merupakan isolat yang memiliki nilai indeks proteolitik tertinggi dan perlu dilakukan analisis lebih lanjut.
Keyword: aktivitas enzim, karakterisasi, kuda, protease

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