Judul: Isolasi dan Identifikasi Senyawa Antibakteri Minyak Atsiri Daun Zodia (Evodia sp.)
Abstrak: Sejak pertama kali ditemukan hingga akhir abad 20, kemoterapi antimikroba telah berhasil menyembuhkan berbagai jenis penyakit infeksi. Masalah muncul pada saat terjadi resistensi bakteri. Meskipun berbagai jenis antibiotik baru ditemukan, muncul masalah baru berkaitan dengan resistensi terhadap berbaai jenis antibiotik Tumbuhan memghasilkan ribuan molekul yang berfungsi bagi tumbuhan itu sendiri maupun lingkungannya. Beberapa jenis komponen minyak atsiri menghasilkan aktivitas antibakteri. Penelitian ini bertujuan untuk menentukan potensi antibakteri minyak atsiri daun zodia, mengisolasi dan mengidentifikasi senyawa aktifnya.
Keyword: Antibacterial Activity, Essential oil, Toksisitas Minyak Atsiri

Judul: Aktivitas Antimikrob Minyak Atsiri dan Potensinya sebagai Antiseptik
Abstrak: Infeksi bakteri patogen menjadi penyebab kematian terbesar di dunia. Salah satu upaya dalam mencegah infeksi patogen adalah melalui aplikasi antiseptik. Salah satu sumber bahan antiseptik adalah minyak atsiri. Penelitian ini bertujuan menganalisis aktivitas antimikrob dari minyak atsiri dan potensinya sebagai antiseptik. Minyak atsiri yang digunakan adalah minyak cengkeh, minyak nilam, minyak serai, minyak jahe, dan minyak pala. Hasil uji antimikrob menggunakan metode agar difusi menunjukkan bahwa seluruh minyak tersebut memiliki aktivitas antibakteri yang beragam dengan zona hambat berkisar antara 0,3 cm – 1,2 cm terhadap Escherichia coli [ATCC 8739], Pseudomonas aeruginosa [ATCC 15442], dan Staphylococcus aureus [ATCC 6538]. Minyak pala memiliki zona hambat terbesar terhadap ketiga jenis bakteri target. Berdasarkan uji viabilitas sel, minyak pala pada konsentrasi 500 ppm dan 1000 ppm berturut-turut dapat menghambat pertumbuhan S.aureus [ATCC 6538] hingga 62% dan 100% setelah 24 jam inkubasi. Analisis antiseptik terstandar berbasis SNI: EN 1040:2005 membuktikan bahwa minyak pala memenuhi persyaratan sebagai antiseptik karena mampu mereduksi densitas bakteri lebih dari 5log10 konsentrasi S. aureus [ATCC 6538] setelah kontak selama 1 menit. Data penelitian ini menunjukkan bahwa minyak pala berpotensi digunakan sebagai agen antimikrob dan bahan aktif penyusun produk antiseptik., Pathogenic bacterial infection is one of the leading causes of mortality worlwide. Essential oil-based antiseptic is needed to prevent pathogenic infection. This study aimed to analyze the antimicrobial activity of essential oils and their antiseptic potential. The essential oils used were clove oil, patchouli oil, citronella oil, ginger oil, and nutmeg oil. These oils had various antibacterial activities with inhibition zones ranging from 0.3 cm – 1.2 cm against Escherichia coli [ATCC 8739], Pseudomonas aeruginosa [ATCC 15442], and Staphylococcus aureus [ATCC 6538], as tested by agar diffusion method. Nutmeg oil had the largest inhibition zone against of three targeted bacteria. Supporting this result, cell viability test showed nutmeg oil in concentraion of 500 ppm and 1000 ppm could inhibit the growth S. aureus [ATCC 6538] up to 62% and 100%, respectively. Analysis of standardized antiseptic based on SNI: EN 1040:2005 proved that nutmeg oil can be used as antiseptic candidate because it was able to reduce the S. aureus [ATCC 6538] more than 5log10 after contact for 1 minute. Our data indicate nutmeg oil can potentially to be applied as an antimicrobial agent and an ingredient of antiseptic products.
Keyword: antimicrobial, antiseptics, essential oil, pathogenic bacteria

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