Judul: Uji aktivitas antibakteri simplisia daun mikania (Mikania micrantha) terhadap Salmonella, Escherichia coli, dan Staphylococcus aureus
Abstrak: Mikania micrantha atau yang dikenal juga dengan nama mikania adalah suatu tumbuhan yang tumbuh merambat dengan cepat. Di Tapanuli Selatan, Sumatera Utara, tumbuhan ini digunakan untuk mengobati luka pendarahan pada kulit. Di Kuantan Singingi, Riau, tumbuhan ini digunakan untuk menangani ulser, abses, skabies, dan penyakit kulit lainnya. Tujuan penelitian ini adalah untuk menguji aktivitas antibakteri simplisia daun mikania (Mikania micrantha) terhadap Salmonella, E. coli, dan S. aureus. Metode uji yang digunakan dalam penelitian ini adalah metode difusi agar dan metode sumur. Ada 5 jenis larutan simplisia daun mikania yang dibedakan berdasarkan tingkat konsentrasinya, yaitu 25%, 12,50%, 6,25%, 3,12%, dan 1,56%. Uji aktivitas antibakteri yang menggunakan metode difusi cakram dan metode sumur menunjukkan bahwa simplisia daun mikania tidak dapat menghambat pertumbuhan Salmonella dan E. coli, namun dapat menghambat pertumbuhan S. aureus. Hasil pengujian aktivitas antibakteri menunjukkan bahwa larutan simplisia daun mikania yang paling efektif menghambat pertumbuhan S. aureus adalah pada konsentrasi 25%.
Keyword: Bogor Agricultural University, Institut Pertanian Bogor, IPB, Antibacterial activity test, Escherichia coli, Mikania micrantha, Salmonella, Staphylococcus aureus

Judul: Efektivitas Antimikroba Ekstrak Daun Sembung Rambat (Mikania micrantha H.B.K.) terhadap Bakteri Gram Positif yang Resisten Penisilin
Abstrak: The used of antibiotic which is uncontroled has lead to the emergence of resistant bacteria, such as penicillin-resistant bacteria. Therefore, many research in finding new antimicrobial drugs are barely needed to be conducted. One of the potential herbs is Mikania micrantha known as sembung rambat in Indonesia, an invasive alien species. The aim of this research was to showed effectivity of crude ethanolic extract of Mikania micrantha leaveas in inhibiting the growth of penicillin G resistent positive Gram bacteria. The crude ethanolic extract of Mikania micrantha leaves was tested penicillin G-resistant positive-Gram bacteria. The method used for in vitro effectivity test in this research was well diffusion agar method in various concentrations. The results obtained that crude ethanolic extract of Mikania micrantha leaveas showed effectivity in inhibiting the growth of penicillin G resistent positive Gram bacteria and the effective concentration is 80% (g / ml).
Keyword: penicillin-resistant bacteria, Bogor Agricultural University (IPB), Mikania micrantha, Antimicrobial

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