Judul: Aktivitas Antioksidan dan Antibakteri Madu dan Propolis Terhadap Bakteri Penyebab Jerawat.
Abstrak: Madu dan propolis memiliki potensi bakteriostatik dan bakteriosida alami yang aktif sebagai antibakteri terhadap Propionibacterium acnes yang merupakan bakteri utama dalam pembentukan jerawat. Tujuan dari penelitian ini adalah menentukan kandungan fitokimia (fenolik dan flavonoid) secara kualitatif dan kuantitatif, dan menentukan aktivitas antioksidan dan antibakteri terhadap P. acnes. Kadar flavonoid dan fenolik ditentukan dengan metode spektrofotometri, aktivitas antioksidan menggunakan metode DPPH (1,1-difenil-2-pikrilhidrazil) dan ABTS (2,2-azinobis(3 etilbenzatiazolin-6-asam sulfonat), dan antibakteri dengan metode mikrodilusi. Madu dan propolis mengandung fenolik dan flavonoid dengan kadar antara 50-2 888 μg GAE/g dan 766-8 838 μg QE/g. Madu Apis cerana Banyuwangi memiliki aktivitas antioksidan dan antibakteri terbaik dibandingkan madu yang lainnya dengan nilai IC50, aktivitas ABTS, serta Konsentrasi Hambat Minimum (KHM) dan Konsentrasi Bakterisid Minimum (KBM) sebesar 60 mg/L, 122 μg trolox/g, 125 mg/mL, dan 500 mg/mL. Ekstrak propolis Tetragonula aff. biroi bagian dalam memiliki aktivitas antioksidan yang lebih baik dibandingkan bagian luar sarang dengan nilai IC50 dan aktivitas ABTS 18 mg/L dan 933 μg trolox/g. Baik madu maupun propolis memiliki aktivitas antibakteri yang dapat menghambat sekaligus membunuh bakteri P. acnes.
Keyword: antibacterial, antioxidant, honey, propolis, P. acnes

Judul: Potensi propolis lebah madu Apis melifera spp sebagai bahan antibakteri
Abstrak: Propolis is known to have antimicrobial activity which can counter many diseases of various kinds of microbes. Also propolis consumption are known not to give any resistance effect. This study aimed to obtain information on the antibacterial activity of propolis Apis melifera spp against to standard test bacteria (S. mutans. E. coli). Propolis concentration tested is 100%, 50%, 25%, 12.5%, 6.25%, 3.13% and compared with commercial propolis, ampicillin (positive control) and distilled water (negative control). The parameters were the formation of clear zone and the number of colonies formed from the test plate count. Observing from the various propolis concentrations above, the propolis A. melifera can inhibit the antibacterial activity on Minimum Growing Inhibitory Concentration (KHTM) at 6.25% concentration. The research carried out for this study obtained propolis an A. melifera effectivity is 105,595% compared to commercial propolis against S. mutans, and 96.770% for E. coli. The other hand propolis an A. melifera effectivity compared to ampicillin is 97.147% against S. mutans and 98.670% against E. Coli.
Keyword: 

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