Judul: Korelasi kadar tanin pada produk teh komersial dengan aktivitasnya sebagai senyawa antibakteri epec K1-1
Abstrak: Enteropathogenic Esclierichia culi (EPEC) merupakan penyebab penting diare pada bayi, khususnya di negara-negara berkembang. Di Indonesia, sekitar 20% dari angka kematian disebabkan oleh diare dengan angka kesakitan diare mencapai 40 -60% dari jumlah penduduk per tahun. Teh pekat telah lama diketahui sebagai salah satu alternatif upaya dalam mengatasi diare. kemampuan mengatasi diare ini diyakini datang dari komponen dalam teh yang disebut tanin. Dalam penelitian ini, dilakukan upaya untuk mengetahui korelasi kadar tanin dalam teh dengan daya antibakterinya terhadap EPEC. Teh yang digunakan diperoleh dari produk-produk teh komersial meliputi teh hijau dan teh hitam lokal dan impor, serta teh oolong lokal. Konsentrasi teh yang diuji coba meliputi 100, 250, dan 500 mg/ml.
Keyword: 

Judul: Penghambatan Enteropatogenik Escherichia Coli (Epec) K11 Oleh Plantarisin E Rekombinan Dengan Perlakuan Edta
Abstrak: Bakteri Enteropatogenik Eschericia coli (EPEC) tergolong dalam bakteri gram negatif termasuk salah satu penyebab penyakit diare. Pengobatan secara umum dilakukan menggunakan antibiotik, namun EPEC K11 mengalami resitensi antibiotik sehingga diperlukan alternatif pengobatan lain. Salah satu alternatifnya adalah peptida antimikroba dari golongan bakteriosin dihasilkan oleh Lactococcus lactis pNZ 8148 Pln E, yaitu plantarisin E rekombinan. Aktivitas antimikroba plantarisin terhadap bakteri gram negatif dapat ditingkatkan dengan penambahan agen pengkelat seperti EDTA. Penelitian ini bertujuan menguji potensi antimikroba plantarisin E rekombinan terhadap penghambatan EPEC K11 dengan penambahan EDTA. Metode yang dilakukan meliputi produksi plantarisin dengan menumbuhkan Lactococcus lactis pNZ 8148 Pln E pada media M17 glukosa. Uji aktivitas plantarisin dilakukan secara kualitatif berdasarkan metode difusi agar. Purifikasi plantarisin menggunakan amonium sulfat dan kolom SP Sepharose. Plantarisin hasil purifikasi ditambahkan EDTA sebanyak 1% v/v dengan berbagai macam konsentrasi dari 1 mM, 5 mM, 10 mM dan 20 mM. Hasil produksi plantarisin diperoleh 200 ml supernatan bebas sel. Hasil purifikasi dengan kolom SP Sepharose menunjukan aktivitas plantarisin sebesar 28.62 AU/mg dengan kandungan total protein sebesar 3.93 mg. Penurunan aktivitas plantarisin akibat pemurnian sebesar 56.25 %. Hasil SDS PAGE menunjukan bobot molekul plantarisin E adalah 3.7 kDa. Perlakuan penambahan EDTA memperlihatkan peningkatan aktivitas penghambatan sebesar 0.5 hingga 4 mm.
Keyword: Antimikroba, EDTA, Lactococcus lactis, purifikasi

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